[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/issac/Kaltofen22>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Erich_L._Kaltofen>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F3476446.3536183>
foaf:homepage <https://doi.org/10.1145/3476446.3536183>
dc:identifier DBLP conf/issac/Kaltofen22 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F3476446.3536183 (xsd:string)
dcterms:issued 2022 (xsd:gYear)
rdfs:label The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Erich_L._Kaltofen>
swrc:pages 177-186 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/issac/2022>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/issac/Kaltofen22/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/issac/Kaltofen22>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/issac/issac2022.html#Kaltofen22>
rdfs:seeAlso <https://doi.org/10.1145/3476446.3536183>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/issac>
dc:title The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document