The following pages link to Logarithmic advice classes (Q1193903):
Displaying 11 items.
- Proof systems that take advice (Q553297) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Modulo classes and logarithmic advice (Q672652) (← links)
- On sets Turing reducible to p-selective sets (Q675861) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Machines that perform measurements (Q2672643) (← links)
- Does Advice Help to Prove Propositional Tautologies? (Q3637158) (← links)
- A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity (Q4301636) (← links)
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047) (← links)
- Degrees and reducibilities of easy tally sets (Q5096899) (← links)
