The following pages link to (Q4780801):
Displaying 5 items.
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Attribute estimation and testing quasi-symmetry (Q976083) (← links)
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem. (Q1866178) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
