Pages that link to "Item:Q3581273"
From MaRDI portal
The following pages link to Some 3CNF properties are hard to test (Q3581273):
Displaying 6 items.
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Robust locally testable codes and products of codes (Q5486320) (← links)