The following pages link to Near-Testable Sets (Q3978780):
Displaying 7 items.
- Reducibility classes of P-selective sets (Q672155) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- On the size of classes with weak membership properties (Q1274925) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Strong self-reducibility precludes strong immunity (Q4895818) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- Sets computable in polynomial time on average (Q6085734) (← links)
