Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling
暂无分享,去创建一个
[1] Friedhelm Meyer auf der Heide,et al. A Comparison of two Variations of a Pebble Game on Graphs , 1981, Theor. Comput. Sci..
[2] Michael Alekhnovich,et al. Space Complexity in Propositional Calculus , 2002, SIAM J. Comput..
[3] Emanuele Viola,et al. On constructing parallel pseudorandom generators from one-way functions , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[4] Nicholas Pippenger. A Time-Space Trade-Off , 1978, JACM.
[5] Bala Kalyanasundaram,et al. On the power of white pebbles , 1991, Comb..
[6] Noam Nisan,et al. Pseudorandom bits for constant depth circuits , 1991, Comb..
[7] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[8] Oded Goldreich,et al. On the Theory of Average Case Complexity , 1992, J. Comput. Syst. Sci..
[9] Ran Raz,et al. On the distribution of the number of roots of polynomials and explicit weak designs , 2003, Random Struct. Algorithms.
[10] Luca Trevisan,et al. Pseudorandomness and average-case complexity via uniform reductions , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[11] David Allen,et al. Optimal Time-Space Tradeoff in Probabilistic Inference , 2003, Probabilistic Graphical Models.
[12] David Bruce Wilson,et al. Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read , 2004, STOC '05.
[13] Robert E. Tarjan,et al. The Pebbling Problem is Complete in Polynomial Space , 1980, SIAM J. Comput..
[14] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[15] Eli Ben-Sasson,et al. Size space tradeoffs for resolution , 2002, STOC '02.
[16] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[17] G. Kalai,et al. Every monotone graph property has a sharp threshold , 1996 .
[18] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[19] Stephen A. Cook,et al. Storage Requirements for Deterministic Polynomial Time Recognizable Languages , 1976, J. Comput. Syst. Sci..
[20] Emanuele Viola,et al. Using nondeterminism to amplify hardness , 2004, STOC '04.
[21] Jakob Nordström,et al. Narrow proofs may be spacious: separating space and width in resolution , 2006, STOC '06.
[22] Toniann Pitassi,et al. An Exponential Time/Space Speedup For Resolution , 2007, Electron. Colloquium Comput. Complex..
[23] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.
[24] Michel Talagrand,et al. How much are increasing sets positively correlated? , 1996, Comb..
[25] Luca Trevisan,et al. On uniform amplification of hardness in NP , 2005, STOC '05.
[26] Robert E. Wilber. White pebbles help , 1985, STOC '85.
[27] Luca Trevisan,et al. List-decoding using the XOR lemma , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[28] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[29] Leonid A. Levin,et al. No better ways to generate hard NP instances than picking uniformly at random , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[30] Russell Impagliazzo,et al. Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification , 2006, FOCS.
[31] Russell Impagliazzo,et al. A personal view of average-case complexity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.
[32] Jacobo Torán,et al. Space Bounds for Resolution , 2001, Inf. Comput..
[33] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[34] Andrzej Lingas. A PSPACE Complete Problem Related to a Pebble Game , 1978, ICALP.
[35] Elchanan Mossel,et al. On the noise sensitivity of monotone functions , 2003, Random Struct. Algorithms.