Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
73 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
- Erschienen in
-
Complexity of turing machine computations
- Ereignis
-
Veröffentlichung
- (wo)
-
Hagen
- (wer)
-
Fernuniv., Gesamthochsch.
- (wann)
-
c 1981
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:37 MESZ
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
- Fernuniv., Gesamthochsch.
Entstanden
- c 1981
Ähnliche Objekte (12)
Complexity of turing machine computations, Course unit 5.. INP complete problems and the polynomial time hierarchy
Complexity of turing machine computations, Course unit 3.. Polynomial time
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Complexity of turing machine computations, Course unit 6.. Polynomial space and logarithm space
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Complexity of pushdown computations
Turing machines with few accepting computations and low sets for PP
Computations on words and their complexity
Quantum Kolmogorov complexity and the Quantum Turing Machine
On the automatic synthesis of turing machines from samples of their computations
Sparse matrix computations and their I O complexity
Sparse Matrix Computations and their I/O Complexity
Complexity of turing machine computations, Course unit 5.. INP complete problems and the polynomial time hierarchy
Complexity of turing machine computations, Course unit 3.. Polynomial time
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Complexity of turing machine computations, Course unit 6.. Polynomial space and logarithm space
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Complexity of pushdown computations
Turing machines with few accepting computations and low sets for PP
Computations on words and their complexity
Quantum Kolmogorov complexity and the Quantum Turing Machine
On the automatic synthesis of turing machines from samples of their computations
Sparse matrix computations and their I O complexity
Sparse Matrix Computations and their I/O Complexity
Complexity of turing machine computations, Course unit 5.. INP complete problems and the polynomial time hierarchy
Complexity of turing machine computations, Course unit 3.. Polynomial time
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Complexity of turing machine computations, Course unit 6.. Polynomial space and logarithm space
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Complexity of pushdown computations
Turing machines with few accepting computations and low sets for PP
Computations on words and their complexity
Quantum Kolmogorov complexity and the Quantum Turing Machine
On the automatic synthesis of turing machines from samples of their computations
Sparse matrix computations and their I O complexity