Number of quantifiers is better than number of tape cells (Q1164622): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043507528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities on finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maze recognizing automata and nondeterministic tape complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Bounded Random Access Machines with Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:49, 13 June 2024

scientific article
Language Label Description Also known as
English
Number of quantifiers is better than number of tape cells
scientific article

    Statements

    Number of quantifiers is better than number of tape cells (English)
    0 references
    0 references
    1981
    0 references
    complexity measure
    0 references
    quantifier number
    0 references
    quantifier rank
    0 references
    uniform sequence of first order formulas
    0 references
    Turing machine
    0 references
    lower bounds
    0 references
    Ehrenfeucht- Fraisse games
    0 references

    Identifiers