Relations between diagonalization, proof systems, and complexity gaps (Q1254105): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036722394 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Complexity and the Existence of Complexity Gaps / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theory of Provable Recursive Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Complexity of One-Tape Turing Machine Computations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Overview of the Theory of Computational Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization Among Provably Equivalent Programs / rank | |||
Normal rank | |||
Latest revision as of 00:23, 13 June 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
