@inbook{4372388efdc7491c85c020b8dad25e42,
title = "Constant-round interactive proof systems for AC0[2] and NC1",
abstract = "We present constant-round interactive proof systems for sufficiently uniform versions of AC0[2] and NC1. Both proof systems are doubly-efficient, and offer a better trade-off between the round complexity and the total communication than the work of Reingold, Rothblum, and Rothblum (STOC, 2016). Our proof system for AC0[2] supports a more relaxed notion of uniformity and offers a better trade-off between the number of rounds and the round complexity that our proof system for NC1. We observe that all three aforementioned systems yield constant-round doubly-efficient proof systems for the All-Pairs Shortest Paths problem.",
author = "Oded Goldreich and Rothblum, {Guy N.}",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.",
year = "2020",
month = apr,
day = "4",
doi = "https://doi.org/10.1007/978-3-030-43662-9_18",
language = "الإنجليزيّة",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "326--351",
editor = "Oded Goldreich",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "ألمانيا",
}