哥德尔奖

哥德尔奖（英語：Gödel Prize）是一個頒發給理論計算機科學領域傑出論文的年度獎項，由歐洲理論計算機科學協會（英语：European Association for Theoretical Computer Science）（EATCS）和美國計算機協會算法和計算理論特別興趣小組（計算機協會算法和計算理論特別興趣小組（英语：ACM SIGACT））聯合頒發。該獎項是為紀念庫爾特·哥德爾而命名的。哥德爾是第一個提出P/NP問題的人，在1956年寫給約翰·馮·諾伊曼的信中，哥德爾問某個NP完全的問題是否可以用二次或是線性時間來解決。 哥德爾獎於1993年開始在STOC（ACM計算理論研討會（英语：Symposium on Theory of Computing），北美理論計算機科學的主要會議之一）或ICALP（自動機、語言和編程國際座談會（英语：International Colloquium on Automata, Languages and Programming），該領域的主要歐洲會議之一）上頒發。獲獎論文必須在理論計算機領域具有開創性重大貢獻，同時需在獲獎前14年內在學術期刊上正式發表。該獎項包括5,000美元的獎金。 哥德爾獎的評審委員會由6名成員組成，分別由EATCS主席和SIGACT主席各提名三名成員，任期三年並交錯進行。委員會由EATCS和SIGACT的代表輪流擔任主席。 Babai, László; Moran, Shlomo, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class (PDF), Journal of Computer and System Sciences, 1988, 36 (2): 254–276 [2022-10-31], ISSN 0022-0000, doi:10.1016/0022-0000(88)90028-1 , （原始内容存档 (PDF)于2011-07-06）  Goldwasser, S.; Micali, S.; Rackoff, C., The knowledge complexity of interactive proof systems (PDF), SIAM Journal on Computing, 1989, 18 (1): 186–208 [2022-10-31], CiteSeerX 10.1.1.397.4002 , ISSN 1095-7111, doi:10.1137/0218012, （原始内容存档 (PDF)于2011-09-27）  Håstad, Johan, Almost Optimal Lower Bounds for Small Depth Circuits (PDF), Micali, Silvio (编), Randomness and Computation, Advances in Computing Research 5, JAI Press: 6–20, 1989, ISBN 978-0-89232-896-3, （原始内容 (PDF)存档于2012-02-22）  Immerman, Neil, Nondeterministic space is closed under complementation (PDF), SIAM Journal on Computing, 1988, 17 (5): 935–938 [2022-10-31], CiteSeerX 10.1.1.54.5941 , ISSN 1095-7111, doi:10.1137/0217058, （原始内容存档 (PDF)于2012-02-07）  Szelepcsényi, R., The method of forced enumeration for nondeterministic automata (PDF), Acta Informatica, 1988, 26 (3): 279–284 [2022-10-31], S2CID 10838178, doi:10.1007/BF00299636, hdl:10338.dmlcz/120489, （原始内容存档 (PDF)于2022-08-01）  Sinclair, A.; Jerrum, M., Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation, 1989, 82 (1): 93–133, ISSN 0890-5401, doi:10.1016/0890-5401(89)90067-9  Jerrum, M.; Sinclair, Alistair, Approximating the permanent, SIAM Journal on Computing, 1989, 18 (6): 1149–1178, CiteSeerX 10.1.1.431.4190 , ISSN 1095-7111, doi:10.1137/0218077  Halpern, Joseph; Moses, Yoram, Knowledge and common knowledge in a distributed environment (PDF), Journal of the ACM, 1990, 37 (3): 549–587 [2022-10-31], S2CID 52151232, arXiv:cs/0006009 , doi:10.1145/79147.79161, （原始内容存档 (PDF)于2019-02-02）  Toda, Seinosuke, PP is as hard as the polynomial-time hierarchy (PDF), SIAM Journal on Computing, 1991, 20 (5): 865–877 [2022-10-31], CiteSeerX 10.1.1.121.1246 , ISSN 1095-7111, doi:10.1137/0220053, （原始内容 (PDF)存档于2016-03-03）  Shor, Peter W., Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, 1997, 26 (5): 1484–1509, ISSN 1095-7111, S2CID 2337707, arXiv:quant-ph/9508027 , doi:10.1137/S0097539795293172  Vardi, Moshe Y.; Wolper, Pierre, Reasoning about infinite computations (PDF), Information and Computation, 1994, 115 (1): 1–37, ISSN 0890-5401, doi:10.1006/inco.1994.1092, （原始内容 (PDF)存档于2011-08-25）  Feige, Uriel; Goldwasser, Shafi; Lovász, Laszlo; Safra, Shmuel; Szegedy, Mario, Interactive proofs and the hardness of approximating cliques (PDF), Journal of the ACM, 1996, 43 (2): 268–292 [2022-10-31], ISSN 0004-5411, doi:10.1145/226643.226652 , （原始内容存档 (PDF)于2011-06-10）  Arora, Sanjeev; Safra, Shmuel, Probabilistic checking of proofs: a new characterization of NP (PDF), Journal of the ACM, 1998, 45 (1): 70–122, ISSN 0004-5411, S2CID 751563, doi:10.1145/273865.273901, （原始内容 (PDF)存档于2011-06-10）  Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario, Proof verification and the hardness of approximation problems (PDF), Journal of the ACM, 1998, 45 (3): 501–555, CiteSeerX 10.1.1.145.4652 , ISSN 0004-5411, S2CID 8561542, doi:10.1145/278298.278306, （原始内容 (PDF)存档于2011-06-10）  Sénizergues, Géraud, L(A) = L(B)? decidability results from complete formal systems, Theor. Comput. Sci., 2001, 251 (1): 1–166, ISSN 0304-3975, doi:10.1016/S0304-3975(00)00285-1   Freund, Y.; Schapire, R.E., A decision-theoretic generalization of on-line learning and an application to boosting (PDF), Journal of Computer and System Sciences, 1997, 55 (1): 119–139 [2022-10-31], ISSN 1090-2724, doi:10.1006/jcss.1997.1504, （原始内容存档 (PDF)于2011-07-19）  Herlihy, Maurice; Shavit, Nir, The topological structure of asynchronous computability (PDF), Journal of the ACM, 1999, 46 (6): 858–923 [2022-10-31], CiteSeerX 10.1.1.78.1455 , S2CID 5797174, doi:10.1145/331524.331529, （原始内容存档 (PDF)于2011-06-05） . Gödel prize lecture （页面存档备份，存于互联网档案馆） Saks, Michael; Zaharoglou, Fotios, Wait-free k-set agreement is impossible: The topology of public knowledge, SIAM Journal on Computing, 2000, 29 (5): 1449–1483, doi:10.1137/S0097539796307698  Alon, Noga; Matias, Yossi; Szegedy, Mario, The space complexity of approximating the frequency moments (PDF), Journal of Computer and System Sciences, 1999, 58 (1): 137–147, doi:10.1006/jcss.1997.1545 . First presented at the Symposium on Theory of Computing (STOC) in 1996. Agrawal, M.; Kayal, N.; Saxena, N., PRIMES is in P, Annals of Mathematics, 2004, 160 (2): 781–793, ISSN 0003-486X, doi:10.4007/annals.2004.160.781   Razborov, Alexander A.; Rudich, Steven, Natural proofs, Journal of Computer and System Sciences, 1997, 55 (1): 24–35, ISSN 0022-0000, doi:10.1006/jcss.1997.1494   Spielman, Daniel A.; Teng, Shang-Hua, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time, J. ACM, 2004, 51 (3): 385–463, ISSN 0004-5411, arXiv:math/0212413 , doi:10.1145/990308.990310  Reingold, Omer; Vadhan, Salil; Wigderson, Avi, Entropy waves, the zig-zag graph product, and new constant-degree expanders, Annals of Mathematics, 2002, 155 (1): 157–187, CiteSeerX 10.1.1.236.8669 , ISSN 0003-486X, JSTOR 3062153, MR 1888797, S2CID 120739405, doi:10.2307/3062153  Reingold, Omer, Undirected connectivity in log-space, J. ACM, 2008, 55 (4): 1–24 [2022-10-31], ISSN 0004-5411, S2CID 207168478, doi:10.1145/1391289.1391291, （原始内容存档于2011-06-12）  Arora, Sanjeev, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, Journal of the ACM, 1998, 45 (5): 753–782, CiteSeerX 10.1.1.23.6765 , ISSN 0004-5411, S2CID 3023351, doi:10.1145/290179.290180  Mitchell, Joseph S. B., Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems, SIAM Journal on Computing, 1999, 28 (4): 1298–1309, ISSN 1095-7111, doi:10.1137/S0097539796309764  Håstad, Johan, Some optimal inapproximability results (PDF), Journal of the ACM, 2001, 48 (4): 798–859 [2022-10-31], CiteSeerX 10.1.1.638.2808 , ISSN 0004-5411, S2CID 5120748, doi:10.1145/502090.502098, （原始内容存档 (PDF)于2012-03-12）  Koutsoupias, Elias; Papadimitriou, Christos. Worst-case equilibria. Computer Science Review. 2009, 3 (2): 65–69. doi:10.1016/j.cosrev.2009.04.003.  Nisan, Noam; Ronen, Amir. Algorithmic Mechanism Design. Games and Economic Behavior. 2001, 35 (1–2): 166–196. CiteSeerX 10.1.1.21.1731 . doi:10.1006/game.1999.0790.  Roughgarden, Tim; Tardos, Éva. How bad is selfish routing?. Journal of the ACM. 2002, 49 (2): 236–259. CiteSeerX 10.1.1.147.1081 . S2CID 207638789. doi:10.1145/506147.506153.  Boneh, Dan; Franklin, Matthew. Identity-based encryption from the Weil pairing. SIAM Journal on Computing. 2003, 32 (3): 586–615. CiteSeerX 10.1.1.66.1131 . MR 2001745. doi:10.1137/S0097539701398521.  Joux, Antoine. A one round protocol for tripartite Diffie-Hellman. Journal of Cryptology. 2004, 17 (4): 263–276. MR 2090557. S2CID 3350730. doi:10.1007/s00145-004-0312-y.  Fagin, Ronald; Lotem, Amnon; Naor, Moni. Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences. 2003, 66 (4): 614–656. arXiv:cs/0204046 . doi:10.1016/S0022-0000(03)00026-6.  Spielman, Daniel A.; Teng, Shang-Hua. Spectral Sparsification of Graphs. SIAM Journal on Computing. 2011, 40 (4): 981–1025. ISSN 0097-5397. S2CID 9646279. arXiv:0808.4134 . doi:10.1137/08074489X.  Spielman, Daniel A.; Teng, Shang-Hua. A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. SIAM Journal on Computing. 2013, 42 (1): 1–26. ISSN 0097-5397. S2CID 9151077. arXiv:0809.3232 . doi:10.1137/080744888.  Spielman, Daniel A.; Teng, Shang-Hua. Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM Journal on Matrix Analysis and Applications. 2014, 35 (3): 835–885. ISSN 0895-4798. S2CID 1750944. arXiv:cs/0607105 . doi:10.1137/090771430.  Brookes, Stephen. A Semantics for Concurrent Separation Logic (PDF). Theoretical Computer Science. 2007, 375 (1–3): 227–270 [2022-10-31]. doi:10.1016/j.tcs.2006.12.034. （原始内容存档 (PDF)于2021-05-09）.  O'Hearn, Peter. Resources, Concurrency and Local Reasoning (PDF). Theoretical Computer Science. 2007, 375 (1–3): 271–307 [2022-10-31]. doi:10.1016/j.tcs.2006.12.035 . （原始内容存档 (PDF)于2021-03-04）.  Dwork, Cynthia; McSherry, Frank; Nissim, Kobbi; Smith, Adam. Halevi, Shai; Rabin, Tal , 编. Calibrating Noise to Sensitivity in Private Data Analysis. Theory of Cryptography (TCC). Lecture Notes in Computer Science 3876. Springer-Verlag: 265–284. 2006. ISBN 978-3-540-32731-8. doi:10.1007/11681878_14 .  Regev, Oded. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM. 2009, 56 (6): 1–40. CiteSeerX 10.1.1.215.3543 . S2CID 207156623. doi:10.1145/1568318.1568324.  Dinur, Irit. The PCP theorem by gap amplification. Journal of the ACM. 2007, 54 (3): 12–es. S2CID 53244523. doi:10.1145/1236457.1236459.  A constructive proof of the general Lovász Local Lemma. Journal of the ACM. 2010, 57 (2). ISSN 0004-5411. doi:10.1145/1667053.  Bulatov, Andrei A. The complexity of the counting constraint satisfaction problem. Journal of the ACM (Association for Computing Machinery (ACM)). 2013, 60 (5): 1–41. ISSN 0004-5411. S2CID 8964233. doi:10.1145/2528400.  Dyer, Martin; Richerby, David. An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM Journal on Computing (Society for Industrial & Applied Mathematics (SIAM)). 2013, 42 (3): 1245–1274. ISSN 0097-5397. S2CID 1247279. arXiv:1003.3879 . doi:10.1137/100811258.  Cai, Jin-Yi; Chen, Xi. Complexity of Counting CSP with Complex Weights. Journal of the ACM (Association for Computing Machinery (ACM)). 2017-06-22, 64 (3): 1–39. ISSN 0004-5411. S2CID 1053684. arXiv:1111.2384 . doi:10.1145/2822891.  Brakerski, Zvika; Vaikuntanathan, Vinod. Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$. SIAM Journal on Computing. January 2014, 43 (2): 831–871. ISSN 0097-5397. doi:10.1137/120868669.  Brakerski, Zvika; Gentry, Craig; Vaikuntanathan, Vinod. (Leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12 (New York, New York, USA: ACM Press). 2012. doi:10.1145/2090236.2090262.  The Gödel Letter. 2009-02-12 [2022-10-31]. （原始内容存档于2019-01-30）.  2017 Gödel Prize. European Association for Theoretical Computer Science. EATCS. [29 March 2017]. （原始内容存档于2019-04-16）.  Three Papers Cited for Laying Foundation of Growth in Algorithmic Game Theory. 16 May 2012 [16 May 2012]. （原始内容存档于18 July 2013）.  ACM Group Presents Gödel Prize for Advances in Cryptography: Three Computer Scientists Cited for Innovations that Improve Security 互联网档案馆的存檔，存档日期2013-06-01., Association for Computing Machinery, May 29, 2013. Recipients Achieved Groundbreaking Results for Aggregating Data from Multiple Sources （页面存档备份，存于互联网档案馆）, Association for Computing Machinery, April 30, 2014. 2015 Gödel Prize announcement 互联网档案馆的存檔，存档日期2017-12-09. by Association for Computing Machinery. 2018 Gödel Prize citation. [2020-05-17]. （原始内容存档于2018-10-05）.  2019 Gödel Prize citation. [2020-05-17]. （原始内容存档于2020-07-28）.  2020 Gödel Prize citation. [2020-05-17]. （原始内容存档于2020-07-16）.  2021 Gödel Prize citation. [2022-10-31]. （原始内容存档于2022-06-04）.  2022 Gödel Prize citation. [2022-10-31]. （原始内容存档于2022-10-31）.