Pages that link to "Item:Q3335768"
From MaRDI portal
The following pages link to On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets (Q3335768):
Displayed 19 items.
- The strong exponential hierarchy collapses (Q584250) (← links)
- Reducibility classes of P-selective sets (Q672155) (← links)
- A note on P-selective sets and closeness (Q673619) (← links)
- Some consequences of non-uniform conditions on uniform classes (Q794427) (← links)
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Notes on polynomial levelability (Q1119389) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- On symmetric differences of NP-hard sets with weakly P-selective sets (Q1314375) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- On intractability of the classUP (Q3201755) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- The Fault Tolerance of NP-Hard Problems (Q3618596) (← links)
- On lower bounds of the closeness between complexity classes (Q4032931) (← links)
- Genericity, Randomness, and Polynomial-Time Approximations (Q4210154) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Complete sets and closeness to complexity classes (Q4727430) (← links)
- On the power of parity polynomial time (Q5750401) (← links)