Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for ..."

Erich L. Kaltofen (2022)

> Home

Details and statistics

DOI: 10.1145/3476446.3536183

access: closed

type: Conference or Workshop Paper

metadata version: 2022-07-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/issac/Kaltofen22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/issac/Kaltofen22
Erich L. Kaltofen:
The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. ISSAC 2022: 177-186

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.