Pages that link to "Item:Q5096868"

The following pages link to E-complete sets do not have optimal polynomial time approximations (Q5096868):

Displayed 2 items.

• Genericity, Randomness, and Polynomial-Time Approximations (Q4210154) ‎ (← links)
• On optimal polynomial time approximations: P-levelability vs. δ-levelability (Q4645194) ‎ (← links)