The following pages link to (Q3334986):
Displayed 8 items.
- The shrinking property for NP and coNP (Q627189) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)