Pages that link to "Item:Q4167585"
From MaRDI portal
The following pages link to Polynomial Time Enumeration Reducibility (Q4167585):
Displaying 17 items.
- The consequences of eliminating NP solutions (Q458458) (← links)
- A note on degrees of presentation of games as relational structures (Q912772) (← links)
- A low and a high hierarchy within NP (Q1052097) (← links)
- Strong nondeterministic polynomial-time reducibilities (Q1055405) (← links)
- Optimization problems and the polynomial hierarchy (Q1152218) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- Logarithmic advice classes (Q1193903) (← links)
- Strong nondeterministic Turing reduction - a technique for proving intractability (Q1262762) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Scalability and the isomorphism problem (Q1351582) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- A survey of one-way functions in complexity theory (Q4009812) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Complete sets and closeness to complexity classes (Q4727430) (← links)
- Promise problems and access to unambiguous computation (Q5096827) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)
