Conference
View in EDS

The GKR Protocol Revisited : Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds

Bibliographic Details
Title: The GKR Protocol Revisited : Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds
Authors: Kaltofen, Erich L.
Source: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. :177-186
Availability: http://dl.acm.org/doi/10.1145/3476446.3536183
Database: ACM Full-Text Collection
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://dx.doi.org/10.1145/3476446.3536183?
    Name: EDS - ACM Full-Text Collection (ns324271)
    Category: fullText
    Text: View record at ACM Digital Library
Header DbId: edscma
DbLabel: ACM Full-Text Collection
An: edscma.3536183
RelevancyScore: 1035
AccessLevel: 2
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 1035.35656738281
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The GKR Protocol Revisited : Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kaltofen%2C+Erich+L%2E%22">Kaltofen, Erich L.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation</i>. :177-186
– Name: URL
  Label: Availability
  Group: URL
  Data: http://dl.acm.org/doi/10.1145/3476446.3536183
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edscma&AN=edscma.3536183
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/3476446.3536183
    Languages:
      – Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 177
    Titles:
      – TitleFull: The GKR Protocol Revisited : Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kaltofen, Erich L.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 04
              M: 07
              Type: published
              Y: 2022
          Identifiers:
            – Type: issn-locals
              Value: edscma.conferences
          Titles:
            – TitleFull: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation
              Type: main
ResultId 1