The following pages link to (Q2768393):
Displayed 6 items.
- Testing permutation properties through subpermutations (Q551179) (← links)
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Functions that have read‐twice constant width branching programs are not necessarily testable (Q4459589) (← links)