The following pages link to Polynomial terse sets (Q1104077):
Displaying 21 items.
- On quasilinear-time complexity theory (Q672330) (← links)
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- Bi-immunity results for cheatable sets (Q920981) (← links)
- Bounded query classes and the difference hierarchy (Q1114678) (← links)
- Nondeterministic bounded query reducibilities (Q1120564) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- On resource-bounded instance complexity (Q1351945) (← links)
- Learning recursive functions from approximations (Q1370868) (← links)
- Time bounded frequency computations (Q1383147) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly (Q2366689) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- One query reducibilities between partial information classes (Q2575741) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- Meeting of the Association for Symbolic Logic, East Lansing, Michigan, 1988 (Q3476784) (← links)
- A proof of Beigel's cardinality conjecture (Q4032650) (← links)
- On computing Boolean connectives of characteristic functions (Q4835862) (← links)
- The power of frequency computation (Q5055904) (← links)
- A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)
