The following pages link to (Q3337458):
Displaying 10 items.
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets (Q1075319) (← links)
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets (Q1314385) (← links)
- Uniformly hard languages. (Q1874273) (← links)
- On the embedding of distributive lattices into recursive polynomial degrees (Q3778007) (← links)
- On MODkP Counting Degrees (Q4264534) (← links)
- Effectively dense Boolean algebras and their applications (Q4505908) (← links)
- The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
