Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems (Q4094391): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
label / en | label / en | ||
Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2307/2039484 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4234441517 / rank | |||
Normal rank | |||
Property / title | |||
Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems (English) | |||
Property / title: Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems (English) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ordinal Hierarchies and Naming Complexity Classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Effective Procedures for Speeding Up Algorithms / 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: The Operator Gap / 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: On Effectively Computable Operators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On size vs. efficiency for programs admitting speed-ups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classes of computable functions defined by bounds on computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational speed-up by effective operators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Honest bounds for complexity classes of recursive functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Speed-Ups by changing the order in which sets are enumerated / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:54, 12 June 2024
scientific article; zbMATH DE number 3514982
Language | Label | Description | Also known as |
---|---|---|---|
English | Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems |
scientific article; zbMATH DE number 3514982 |
Statements
1973
0 references
Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems (English)
0 references