Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
73 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
- Bibliographic citation
-
Complexity of turing machine computations
- Event
-
Veröffentlichung
- (where)
-
Hagen
- (who)
-
Fernuniv., Gesamthochsch.
- (when)
-
c 1981
- 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:37 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
- Fernuniv., Gesamthochsch.
Time of origin
- c 1981
Other Objects (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 unit 6.. Polynomial space and logarithm space
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Turing machines with few accepting computations and low sets for PP
Complexity of turing machine computations, Course units 1 and 2.. Introduction
On the automatic synthesis of turing machines from samples of their computations
inpRo
Hans During (Turing): Dienstgeld; Siegel: Hans Turing.
Hans Düring (Turing): Dienstgeld; Siegel: Hans Turing.
Programming with Turing and object oriented Turing, Buch.
"mogul" InP!
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 unit 6.. Polynomial space and logarithm space
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Turing machines with few accepting computations and low sets for PP
Complexity of turing machine computations, Course units 1 and 2.. Introduction
On the automatic synthesis of turing machines from samples of their computations
inpRo
Hans During (Turing): Dienstgeld; Siegel: Hans Turing.
Hans Düring (Turing): Dienstgeld; Siegel: Hans Turing.
Programming with Turing and object oriented Turing, Buch.
"mogul" InP!
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 unit 6.. Polynomial space and logarithm space
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Turing machines with few accepting computations and low sets for PP
Complexity of turing machine computations, Course units 1 and 2.. Introduction
On the automatic synthesis of turing machines from samples of their computations
inpRo
Hans During (Turing): Dienstgeld; Siegel: Hans Turing.
Hans Düring (Turing): Dienstgeld; Siegel: Hans Turing.
Programming with Turing and object oriented Turing, Buch.