Universal quantifiers and time complexity of random access machines (Q3699679): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectrum hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectra of First-Order Sentences and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for first order expressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines and the spectra of first-order formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for classes of quantificational formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on Generalized Spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes and theories of finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound results on lengths of second-order formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storage Modification Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773294 / rank
 
Normal rank

Latest revision as of 19:26, 14 June 2024

scientific article
Language Label Description Also known as
English
Universal quantifiers and time complexity of random access machines
scientific article

    Statements

    Universal quantifiers and time complexity of random access machines (English)
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    spectrum of a sentence
    0 references
    prenex first-order sentences
    0 references
    Nondeterministic Random Access Machines
    0 references
    generalised spectra
    0 references
    alternating spectra
    0 references