- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540667520
3540667520
- Maße
-
24 cm
- Umfang
-
XII, 168 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Literaturverz. S. 149 - 157
- Erschienen in
-
Algorithms and computation in mathematics ; Vol. 7
- Schlagwort
-
Berechnungskomplexität
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin, Heidelberg, New York, Barcelona, Hong Kong, London, Milan, Paris, Singapore, Tokyo
- (wer)
-
Springer
- (wann)
-
2000
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:23 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bürgisser, Peter
- Springer
Entstanden
- 2000
Ähnliche Objekte (12)
Algebraic complexity theory
Independence in algebraic complexity theory
Algebraic closures in complexity theory
Independence in Algebraic Complexity Theory
Randomness and completeness in computational complexity
On numerical invariants in algebraic complexity theory
Variety Membership Testing in Algebraic Complexity Theory
On numerical invariants in algebraic complexity theory
Invariant theory in computational complexity and algebraic statistics
Completeness theory for propositional logics
On the complexity of some problems in algorithmic algebraic number theory
Completeness problems in the structural theory of automata
Algebraic complexity theory
Independence in algebraic complexity theory
Algebraic closures in complexity theory
Independence in Algebraic Complexity Theory
Randomness and completeness in computational complexity
On numerical invariants in algebraic complexity theory
Variety Membership Testing in Algebraic Complexity Theory
On numerical invariants in algebraic complexity theory
Invariant theory in computational complexity and algebraic statistics
Completeness theory for propositional logics
On the complexity of some problems in algorithmic algebraic number theory
Completeness problems in the structural theory of automata
Algebraic complexity theory
Independence in algebraic complexity theory
Algebraic closures in complexity theory
Independence in Algebraic Complexity Theory
Randomness and completeness in computational complexity
On numerical invariants in algebraic complexity theory
Variety Membership Testing in Algebraic Complexity Theory
On numerical invariants in algebraic complexity theory
Invariant theory in computational complexity and algebraic statistics
Completeness theory for propositional logics
On the complexity of some problems in algorithmic algebraic number theory