The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds.
Erich L. KaltofenPublished in: ISSAC (2022)
Keyphrases
- worst case
- computational complexity
- computational cost
- learning algorithm
- lightweight
- space complexity
- bounded treewidth
- exhaustive search
- optimal solution
- optimization problems
- np hard
- dynamic programming
- computationally efficient
- building blocks
- approximation algorithms
- special case
- computationally tractable
- lower complexity
- data structure
- complexity bounds