Exponential-time and subexponential-time sets (Q1261474): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bi-immune sets for complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / 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: Completeness for nondeterministic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems and strong polynomial reducibilities / 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: Some remarks on witness functions for nonpolynomial and noncomplete sets in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reducibility to Complex or Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Approximations and Polynomially Levelable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density and complexity of polynomial cores for intractable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and closeness to complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On one-one polynomial time equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time completeness notions / rank
 
Normal rank

Revision as of 09:16, 22 May 2024

scientific article
Language Label Description Also known as
English
Exponential-time and subexponential-time sets
scientific article

    Statements

    Identifiers