The computational complexity of algebraic and numeric problems
Na minha lista:
| Principais autores: | Borodin, Allan, 1941-, Munro, Ian, 1947- (Autor) |
|---|---|
| Formato: | Livre papier |
| Idioma: | Anglais |
| Publicado em: |
New York ; London ; Amsterdam :
American Elsevier
C 1975.
|
| coleção: | Elsevier computer science library : Theory of computation series
1 |
| Assuntos: | |
| Autres localisations: | Voir dans le Sudoc |
Registros relacionados
-
Computational complexity
(Livre papier)
Papadimitriou, Christos H., 1949-
Addison-Wesley, 1994 -
The computational complexity of equivalence and isomorphism problems
(Livre numérique)
Thierauf, Thomas -
The computational complexity of logical theories
(Livre numérique)
Ferrante, Jeanne, 1949-, et al. -
Randomness and completeness in computational complexity
(Livre numérique)
Van Melkebeek, Dieter -
Computational complexity of bilinear forms : algebraic coding theory and applications of digital communication systems
(Livre numérique)
Krishna, Hari, 1960-

