On relationships between complexity classes of Turing machines (Q1682916): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MathOverflow / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s096554251704011x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2615658319 / rank
 
Normal rank

Latest revision as of 09:25, 30 July 2024

scientific article
Language Label Description Also known as
English
On relationships between complexity classes of Turing machines
scientific article

    Statements

    On relationships between complexity classes of Turing machines (English)
    0 references
    0 references
    0 references
    6 December 2017
    0 references
    P vs NP problem
    0 references
    \(\mathrm{DSPACE}(|X|^n)\) vs \(\mathrm{NSPACE}(|X|^n)\)
    0 references
    polynomial reducibility
    0 references
    Karp reducibility
    0 references
    NP-complete Turing machines
    0 references
    computational complexity
    0 references
    deterministic Turing machines
    0 references
    nondeterministic Turing machines
    0 references

    Identifiers