Relations between diagonalization, proof systems, and complexity gaps (Q1254105): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1071499 |
Changed an Item |
||
| Property / author | |||
| Property / author: Juris Hartmanis / rank | |||
Normal rank | |||
Revision as of 10:43, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relations between diagonalization, proof systems, and complexity gaps |
scientific article |
Statements
Relations between diagonalization, proof systems, and complexity gaps (English)
0 references
1979
0 references
One-Tape Turing Machines
0 references
Diagonal Processes over Time Bounded Computations
0 references
Proof Systems
0 references
Existence of Sharp Time Bounds
0 references
Complexity Classes
0 references
Gap Theorem
0 references
Tape Bound Computations
0 references
