Related Research Articles
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover possesses unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest. Messages are sent between the verifier and prover until the verifier has an answer to the problem and has "convinced" itself that it is correct.
In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability. A standard proof, as used in the verifier-based definition of the complexity class NP, also satisfies these requirements, since the checking procedure deterministically reads the whole proof, always accepts correct proofs and rejects incorrect proofs. However, what makes them interesting is the existence of probabilistically checkable proofs that can be checked by reading only a few bits of the proof using randomness in an essential way.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. It is equal to the class PSPACE. The result was established in a series of papers: the first by Lund, Karloff, Fortnow, and Nisan showed that co-NP had multiple prover interactive proofs; and the second, by Shamir, employed their technique to establish that IP=PSPACE. The result is a famous example where the proof does not relativize.
Russell Graham Impagliazzo is a professor of computer science at the University of California, San Diego, specializing in computational complexity theory.
In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs of constant query complexity and logarithmic randomness complexity.
David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
Mario Szegedy is a Hungarian-American computer scientist, professor of computer science at Rutgers University. He received his Ph.D. in computer science in 1989 from the University of Chicago after completing his dissertation titled Algebraic Methods in Lower Bounds for Computational Models. He held a Lady Davis Postdoctoral Fellowship at the Hebrew University of Jerusalem (1989–90), a postdoc at the University of Chicago, 1991–92, and a postdoc at Bell Laboratories (1992).
In computational complexity theory, L/poly is the complexity class of logarithmic space machines with a polynomial amount of advice. L/poly is a non-uniform logarithmic space class, analogous to the non-uniform polynomial time class P/poly.
David Peleg is an Israeli computer scientist. He is a professor at the Weizmann Institute of Science, holding the Norman D. Cohen Professorial Chair of Computer Sciences, and the present dean of the Faculty of Mathematics and Computer Science in Weizmann Institute. His main research interests are algorithms, computer networks, and distributed computing. Many of his papers deal with a combination of all three.
Frances Foong Chu Yao is a Taiwanese-American mathematician and theoretical computer scientist. She is currently a Chair Professor at the Institute for Interdisciplinary Information Sciences (IIIS) of Tsinghua University. She was Chair Professor and Head of the Department of computer science at the City University of Hong Kong, where she is now an honorary professor.
Larry Joseph Stockmeyer was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer.
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.
Ran Raz is a computer scientist who works in the area of computational complexity theory. He was a professor in the faculty of mathematics and computer science at the Weizmann Institute. He is now a professor of computer science at Princeton University.
ProVerif is a software tool for automated reasoning about the security properties found in cryptographic protocols. The tool has been developed by Bruno Blanchet.
Lance Jeremy Fortnow is a computer scientist known for major results in computational complexity and interactive proof systems. As of January 2024, he was the Dean of the College of Computing at the Illinois Institute of Technology.
John Harrison Watrous is the Technical Director of IBM Quantum Education at IBM and was a professor of computer science at the David R. Cheriton School of Computer Science at the University of Waterloo, a member of the Institute for Quantum Computing, an affiliate member of the Perimeter Institute for Theoretical Physics and a Fellow of the Canadian Institute for Advanced Research. He was a faculty member in the Department of Computer Science at the University of Calgary from 2002 to 2006 where he held a Canada Research Chair in quantum computing.
Verifiable computing enables a computer to offload the computation of some function, to other perhaps untrusted clients, while maintaining verifiable results. The other clients evaluate the function and return the result with a proof that the computation of the function was carried out correctly. The introduction of this notion came as a result of the increasingly common phenomenon of "outsourcing" computation to untrusted users in projects such as SETI@home and also to the growing desire to enable computationally-weak devices to outsource computational tasks to a more powerful computation service, as in cloud computing. The concept dates back to work by Babai et al., and has been studied under various terms, including "checking computations", "delegating computations", "certified computation", and verifiable computing. The term verifiable computing itself was formalized by Rosario Gennaro, Craig Gentry, and Bryan Parno, and echoes Micali's "certified computation".
Baruch Awerbuch is an Israeli-American computer scientist and a professor of computer science at Johns Hopkins University. He is known for his research on distributed computing.
Noam Nisan is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.
References
- ↑ Lund's home page at AT&T.
- ↑ Kolata, Gina (June 26, 1990), "In a Frenzy, Math Enters Age of Electronic Mail", The New York Times .
- ↑ Lund, Carsten; Fortnow, Lance; Karloff, Howard J.; Nisan, Noam (1990), "Algebraic Methods for Interactive Proof Systems", Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 2–10, doi:10.1109/FSCS.1990.89518, ISBN 978-0-8186-2082-9, S2CID 32614901 . Later published in JACM, 1991, doi : 10.1145/146585.146605.
- ↑ Babai, László; Fortnow, Lance; Lund, Carsten (1990), "Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols", Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 16–25, CiteSeerX 10.1.1.130.9311 , doi:10.1109/FSCS.1990.89520, ISBN 978-0-8186-2082-9, S2CID 38429596 . Later published in Computational Complexity, 1991, doi : 10.1007/BF01200056.
- ↑ Cartsten Lund at the Mathematics Genealogy Project.
- ↑ Koppes, Steve (May 11, 2000), "Ph.D. recipient receives top award in the field of computer science", University of Chicago Chronicle, 19 (16).
- ↑ Kolata, Gina (April 7, 1992), "New Short Cut Found For Long Math Proofs", The New York Times .
- ↑ Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario (1998), "Proof verification and the hardness of approximation problems", Journal of the ACM, 45 (3): 501–555, doi:10.1145/278298.278306, S2CID 8561542 . Originally presented at the 1992 Symposium on Foundations of Computer Science, doi : 10.1109/SFCS.1992.267823.
- ↑ Parberry, Ian (2001), 2001 Gödel Prize, ACM SIGACT .
- ↑ Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J. (2000), "NetScope: traffic engineering for IP networks", IEEE Network, 14 (2): 11–19, CiteSeerX 10.1.1.42.2801 , doi:10.1109/65.826367 .
- ↑ Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J.; True, F. (2001), "Deriving traffic demands for operational IP networks: methodology and experience", IEEE/ACM Transactions on Networking, 9 (3): 265–279, CiteSeerX 10.1.1.43.3549 , doi:10.1109/90.929850, S2CID 32689094 .
- ↑ Keshav, S.; Lund, C.; Phillips, S.; Reingold, N.; Saran, H. (1995). "An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks". IEEE Journal on Selected Areas in Communications. 13 (8): 1371–1382. doi:10.1109/49.464709.
