- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Journal of Computer and System Sciences, Band 44, Ausgabe 2, Seite 272-286, 1992
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Humboldt-Universität zu Berlin
- (when)
-
1992
- Creator
-
Köbler, Johannes
Schöning, Uwe
Toda, Seinosuke
Toran, Jacobo
- DOI
-
10.18452/9149
- URN
-
urn:nbn:de:kobv:11-10054699
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
02.10.2024, 12:45 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
- Köbler, Johannes
- Schöning, Uwe
- Toda, Seinosuke
- Toran, Jacobo
- Humboldt-Universität zu Berlin
Time of origin
- 1992
Other Objects (12)
On the automatic synthesis of turing machines from samples of their computations
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Complexity of turing machine computations, Course unit 3.. Polynomial time
On sets Turing reducible to p-selective sets
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Machines, computations, and universality : third international conference
Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
Relationships between pushdown automata and tape-bounded turing machines
Reachability for infinite time Turing machines with long tapes
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Complexity of turing machine computations, Course unit 6.. Polynomial space and logarithm space
On the automatic synthesis of turing machines from samples of their computations
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Complexity of turing machine computations, Course unit 3.. Polynomial time
On sets Turing reducible to p-selective sets
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Machines, computations, and universality : third international conference
Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
Relationships between pushdown automata and tape-bounded turing machines
Reachability for infinite time Turing machines with long tapes
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions
Complexity of turing machine computations, Course unit 6.. Polynomial space and logarithm space
On the automatic synthesis of turing machines from samples of their computations
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Complexity of turing machine computations, Course unit 3.. Polynomial time
On sets Turing reducible to p-selective sets
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Machines, computations, and universality : third international conference
Complexity of turing machine computations, Course unit 4.. Alternation ; INP complete problems
Relationships between pushdown automata and tape-bounded turing machines
Reachability for infinite time Turing machines with long tapes
Complexity of turing machine computations, Course unit 7.. Conclusions, applications and open questions