Lectures on the complexity of bilinear problems :: SCD d'Orléans

Lectures on the complexity of bilinear problems

Lectures on the complexity of bilinear problems

Kaydedildi:

Detaylı Bibliyografya
Yazar:	Groote, Hans Friedrich de, 1944-
Materyal Türü:	Livre numérique
Dil:	Anglais
Baskı/Yayın Bilgisi:	Berlin [etc.] : Springer [20..]. Cham : Springer Nature
Seri Bilgileri:	Lecture notes in computer science 245
Konular:	Informatique Algorithmes Complexité de calcul (informatique) Analyse numérique Formes bilinéaires Applications (mathématiques)
Online Erişim:	Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL
Not:	Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale)
Autres localisations:	Voir dans le Sudoc
Edition sous un autre format:	• Lectures on the complexity of bilinear problems, H.F. de Groote, Berlin, Springer-Verlag, 1987, 1 vol. (135 p.), Lecture notes in computer science, 0-387-17205-X • Lectures on the Complexity of Bilinear Problems, Texte imprimé, 9783662205884

Benzer Materyaller

Computational complexity of bilinear forms : algebraic coding theory and applications of digital communication systems
Yazar:: Krishna, Hari, 1960-

Symmetric bilinear forms
Yazar:: Milnor, John W., 1931-, ve diğerleri
Baskı/Yayın Bilgisi: (1973)

Symmetric bilinear forms
Yazar:: Milnor, John Willard, 1931-, ve diğerleri

Randomness and completeness in computational complexity
Yazar:: Van Melkebeek, Dieter

Complexity and structure
Yazar:: Schöning, Uwe, 1955-

Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers

Le Calcul intensif
Yazar:: Stockmeyer, Larry, 1948-, ve diğerleri
Baskı/Yayın Bilgisi: (1989)

The computational complexity of equivalence and isomorphism problems
Yazar:: Thierauf, Thomas

Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers
Yazar:: Leivant, Daniel

Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 2000 : proceedings

Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings

Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings

Structure in complexity theory : proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986

Algorithms and complexity : 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003 : proceedings

Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings

The computational complexity of algebraic and numeric problems
Yazar:: Borodin, Allan, 1941-, ve diğerleri
Baskı/Yayın Bilgisi: (1975)

Efficient checking of polynomials and proofs and the hardness of approximation problems
Yazar:: Sudan, Madhu

The computational complexity of logical theories
Yazar:: Ferrante, Jeanne, 1949-, ve diğerleri

Lectures on proof verification and approximation algorithms
Yazar:: Mayr, Ernst W., 1950-

Essays on the complexity of continuous problems
Baskı/Yayın Bilgisi: (2009)

Computational complexity
Yazar:: Papadimitriou, Christos H., 1949-
Baskı/Yayın Bilgisi: (1994)

Journal of complexity.

High Performance computing for computational science : VECPAR 2012 : 10th International Conference, Kope, Japan, July 17-20, 2012 : evised Selected Papers
Yazar:: Daydé, Michel, 1957-

Complexité algorithmique
Yazar:: Perifel, Sylvain, 1982-
Baskı/Yayın Bilgisi: (2014)

Fundamentals of computation theory : 8th International Conference, FCT '91 Gosen, Germany, September 9 13, 1991 : proceedings

Modified branching programs and their computational power
Yazar:: Meinel, Christoph, 1954-...., Professeur

Applied Parallel Computing : Advanced Scientific Computing 6th International Conference, PARA 2002 Espoo, Finland, June 15 18, 2002 Proceedings

Fundamentals of computation theory : International Conference FCT '89 Szeged, Hungary, August 21 25, 1989 : proceedings

Fundamentals of computation theory : ; proceedings 14th international symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003

Fundamentals of computation theory : 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001 : proceedings

SWAT 88 : 1st Scandinavian workshop on algorithm theory, Halmstad, Sweden, July 5 8, 1988 : proceedings

Computation theory : fifth symposium, Zaborow, Poland, December 3-8, 1984 : proceedings

Algorithmes et complexité
Yazar:: Wilf, Herbert S., 1931-2012, mathématicien
Baskı/Yayın Bilgisi: (1989)

Recursion theory and computational complexity : Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 14-23, 1979
Yazar:: Lolli, Gabriele, 1942-
Baskı/Yayın Bilgisi: (2011)

Algorithm theory - SWAT '94 : 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6 8, 1994 : proceedings

Algorithm theory - SWAT '96 : 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3 5, 1996 : proceedings

Mathématiques discrètes et informatique
Yazar:: Nguyen, Huy Xuong, 19..-...., informaticien
Baskı/Yayın Bilgisi: (1992)

Optimization approaches for solving string selection problems
Yazar:: Pappalardo, Elisa, 19..-, ve diğerleri

Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Yazar:: Cox, David A., 1948-, ve diğerleri
Baskı/Yayın Bilgisi: (1997)

SWAT 90 : 2nd Scandinavian workshop on algorithm theory, Bergen, Sweden, July 11 14, 1990 : proceedings

© 2021-2023 • Université d'Orléans, Service Commun de Documentation, 6 rue de Tours, 45072 Orléans cedex 2
+33(0) 2 38 41 71 84 • https://scd.univ-orleans.fr • Mentions légales