Pages that link to "Item:Q3220572"
From MaRDI portal
The following pages link to Sublattices of the polynomial time degrees (Q3220572):
Displayed 13 items.
- A characterization of the leaf language classes (Q287160) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- On the relative complexity of hard problems for complexity classes without complete problems (Q1112017) (← links)
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
- The structure of the honest polynomial m-degrees (Q1341316) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- On the structures inside truth-table degrees (Q2747717) (← links)
- Exact Pairs for Abstract Bounded Reducibilities (Q4264535) (← links)
- The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
- Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (Q5687321) (← links)