Observations on complete sets between linear time and polynomial time (Q627129): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonerasing, counting, and majority over the linear time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quasilinear-time complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Is Quasilinear Complete in NQL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudimentary Predicates and Relative Computation / rank
 
Normal rank

Latest revision as of 19:43, 3 July 2024

scientific article
Language Label Description Also known as
English
Observations on complete sets between linear time and polynomial time
scientific article

    Statements

    Observations on complete sets between linear time and polynomial time (English)
    0 references
    0 references
    21 February 2011
    0 references
    many-one reducibility
    0 references
    completeness
    0 references
    determinism versus nondeterminism
    0 references
    polynomial-time hierarchy
    0 references
    linear-time hierarchy
    0 references
    Boolean hierarchy
    0 references

    Identifiers