ผลต่างระหว่างรุ่นของ "Computational complexity/paper list"

รุ่นแก้ไขเมื่อ 21:51, 11 พฤษภาคม 2564

ด้านล่างเป็นรายการงานวิจัยสำหรับเขียนสรุปส่ง

Space Complexity
- Omer Reingold, Undirected connectivity in log-space, JACM 2008. [1]
  - notes: [2] by Emanuele Vioa
Polynomial hierarchy
- Christopher Umans, Hardness of Approximating $\Sigma _{2}^{p}$ Minimization Problems, FOCS'99. [3] .ps
Time-space trade-off
- Williams. Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. Computational Complexity vol. 17, pp 179–219(2008) [4] or pdf
- (upperbound for specific problems) Lincoln, Andrea & Williams, Virginia & Wang, Joshua & Williams, Richard. (2016). Deterministic Time-Space Tradeoffs for k-SUM. ICALP2016. pdf or arxiv
Derandomization
- Nisan & Wigderson, Hardness vs randomness, JCSS, 1994. [5]
Zero knowledge proofs
- Goldwasser, Micali & Rackoff. The knowledge complexity of interactive proof-systems. STOC'85. [6] Journal version: pdf
- Goldreich, Micali, Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. JACM'91 [7] pdf

@@ แถว 11: / แถว 11: @@
 * Derandomization
 ** Nisan & Wigderson, Hardness vs randomness, JCSS, 1994. [https://www.sciencedirect.com/science/article/pii/S0022000005800431]
+* Zero knowledge proofs
+** Goldwasser, Micali & Rackoff. The knowledge complexity of interactive proof-systems. STOC'85. [https://dl.acm.org/doi/10.1145/22145.22178] Journal version: [https://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Proof%20Systems/The_Knowledge_Complexity_Of_Interactive_Proof_Systems.pdf pdf]
+** Goldreich, Micali, Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. JACM'91 [https://dl.acm.org/doi/10.1145/116825.116852] [https://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Zero%20Knowledge/Proofs_That_Yield_Nothing_But_Their_Validity_or_All_Languages_in_NP_Have_Zero-Knowledge_Proof_Systems.pdf pdf]