Pages that link to "Item:Q626662"
From MaRDI portal
The following pages link to On the approximation resistance of a random predicate (Q626662):
Displaying 5 items.
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- Circumventing \(d\)-to-\(1\) for approximation resistance of satisfiable predicates strictly containing parity of width at least four (Q3191593) (← links)
- A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← links)
- The Complexity of Somewhat Approximation Resistant Predicates (Q5167783) (← links)
- Approximation resistance on satisfiable instances for predicates with few accepting inputs (Q5495816) (← links)