Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP.
Oded GoldreichTom GurPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- constraint satisfaction problems
- product configuration
- constraint satisfaction
- data sets
- constraint programming
- virtual reality
- formal proof
- error correction
- user interaction
- constraint problems
- tree decomposition
- arc consistency
- theorem prover
- decomposition methods
- constraint propagation
- theorem proving
- user friendly