New developments in structural complexity theory (Q913509): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse sets in NP-P: EXPTIME versus NEXPTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation times of NP sets of different densities / 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: Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse oracles for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativization of questions about log space computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions among polynomial isomorphism types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations on Separating Nondeterministic Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded hierarchies and probabilistic computations / 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: Structure in complexity theory. Proceedings of the Conference held at the University of California, Berkeley, California, June 2-5, 1986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank

Revision as of 14:45, 20 June 2024

scientific article
Language Label Description Also known as
English
New developments in structural complexity theory
scientific article

    Statements

    New developments in structural complexity theory (English)
    0 references
    1990
    0 references
    See the review in Zbl 0649.68047.
    0 references
    survey
    0 references
    structural complexity theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers