Optimal Approximations and Polynomially Levelable Sets
From MaRDI portal
Recommendations
Cited in
(23)- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
- A classification of complexity core lattices
- The structure of generalized complexity cores
- Notes on polynomial levelability
- On sets polynomially enumerable by iteration
- Exponential-time and subexponential-time sets
- On the size of classes with weak membership properties
- Better approximations of non-Hamiltonian graphs
- On inefficient special cases of NP-complete problems
- An efficient case for computing minimum linear arboricity with small maximum degree
- Resource bounded immunity and simplicity
- LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES
- Asymptotically Optimal Hitting Sets Against Polynomials
- scientific article; zbMATH DE number 3913678 (Why is no real title available?)
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP
- scientific article; zbMATH DE number 4029534 (Why is no real title available?)
- OnP-subset structures
- Polynomial Time Productivity, Approximations, and Levelability
- Genericity, Randomness, and Polynomial-Time Approximations
- Productive functions and isomorphisms
- On optimal polynomial time approximations: p-levelability vs. -levelability
- E-complete sets do not have optimal polynomial time approximations
- Approximation of coNP sets by NP-complete sets
This page was built for publication: Optimal Approximations and Polynomially Levelable Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787474)
