- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540410324
3540410325
- Dimensions
-
24 cm
- Extent
-
VIII, 135 S.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 121 - 130
- Bibliographic citation
-
Lecture notes in computer science ; Vol. 1852
- Keyword
-
Berechnungskomplexität
Binäres Entscheidungsdiagramm
Boolesche Formel
- Event
-
Veröffentlichung
- (where)
-
Berlin, Heidelberg, New York, Barcelona, Hong Kong, London, Milan, Paris, Singapore, Tokyo
- (who)
-
Springer
- (when)
-
2000
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:36 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Thierauf, Thomas
- Springer
Time of origin
- 2000
Other Objects (12)
The computational complexity of equivalence and isomorphism problems
Kolmogorov complexity and computational complexity
Randomness and completeness in computational complexity
Logic and computational complexity : selected papers
The computational complexity of logical theories
Irreducibility and computational equivalence : 10 years after Wolfram's A New Kind of Science
Computational complexity
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Complexity classifications for different equivalence and audit problems for boolean circuits
Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
The computational complexity of equivalence and isomorphism problems
Kolmogorov complexity and computational complexity
Randomness and completeness in computational complexity
Logic and computational complexity : selected papers
The computational complexity of logical theories
Irreducibility and computational equivalence : 10 years after Wolfram's A New Kind of Science
Computational complexity
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Complexity classifications for different equivalence and audit problems for boolean circuits
Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
The computational complexity of equivalence and isomorphism problems
Kolmogorov complexity and computational complexity
Randomness and completeness in computational complexity
Logic and computational complexity : selected papers
The computational complexity of logical theories
Irreducibility and computational equivalence : 10 years after Wolfram's A New Kind of Science
Computational complexity
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Complexity classifications for different equivalence and audit problems for boolean circuits