-
1
-
-
0004068238
-
-
Dover Publications, Mineola, NY
-
I. ANDERSON, Combinatorics of Finite Sets, 2nd ed., Dover Publications, Mineola, NY, 2002.
-
(2002)
Combinatorics of Finite Sets, 2nd Ed.
-
-
Anderson, I.1
-
2
-
-
0002771903
-
Nondeterministic exponential time has two-prover interactive protocols
-
L. BABAI, L. FORTNOW, AND C. LUND, Nondeterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3-40.
-
(1991)
Comput. Complexity
, vol.1
, pp. 3-40
-
-
Babai, L.1
Fortnow, L.2
Lund, C.3
-
3
-
-
0001338853
-
BPP has subexponential time simulations unless EXPTIME has publishable proofs
-
L. BASAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), pp. 307-318.
-
(1993)
Comput. Complexity
, vol.3
, pp. 307-318
-
-
Basai, L.1
Fortnow, L.2
Nisan, N.3
Wigderson, A.4
-
4
-
-
33745511846
-
Hiding instances in multioracle queries
-
Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, Springer, New York
-
D. BEAVER AND J. FEIGENBAUM, Hiding instances in multioracle queries, in Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 415, Springer, New York, 1990, pp. 37-48.
-
(1990)
Lecture Notes in Comput. Sci.
, vol.415
, pp. 37-48
-
-
Beaver, D.1
Feigenbaum, J.2
-
5
-
-
0002897287
-
Collective coin-flipping
-
Silvio Micali, ed., Academic Press, New York
-
M. BEN-OR AND N. LINIAL, Collective coin-flipping, in Randomness and Computation, Silvio Micali, ed., Academic Press, New York, 1990, pp. 91-115.
-
(1990)
Randomness and Computation
, pp. 91-115
-
-
Ben-Or, M.1
Linial, N.2
-
6
-
-
0344550509
-
On worst-case to average-case reductions for NP problems
-
Cambridge, MA, 2003, IEEE Press, Piscataway, NJ
-
A. BOGDANOV AND L. TREVISAN, On worst-case to average-case reductions for NP problems, in Proceedings of the 44th Annual Symposium on Foundations of Computer Science, Cambridge, MA, 2003, IEEE Press, Piscataway, NJ, 2003, pp. 308-317.
-
(2003)
Proceedings of the 44th Annual Symposium on Foundations of Computer Science
, pp. 308-317
-
-
Bogdanov, A.1
Trevisan, L.2
-
7
-
-
84957045104
-
On the hardness of the permanent
-
Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, New York
-
J.-Y. CAI, A. PAVAN, AND D. SIVAKUMAR, On the hardness of the permanent, in Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1563, Springer-Verlag, New York, 1999, pp. 90-99.
-
(1999)
Lecture Notes in Comput. Sci.
, vol.1563
, pp. 90-99
-
-
Cai, J.-Y.1
Pavan, A.2
Sivakumar, D.3
-
8
-
-
0039015429
-
On the hardness of computing the permanent of random matrices
-
U. FEIGE AND C. LUND, On the hardness of computing the permanent of random matrices, Comput. Complexity, 6 (1996), pp. 101-132.
-
(1996)
Comput. Complexity
, vol.6
, pp. 101-132
-
-
Feige, U.1
Lund, C.2
-
9
-
-
0027684980
-
Random-self-reducibility of complete sets
-
J. FEIGENBAUM AND L. FORTNOW, Random-self-reducibility of complete sets, SIAM J. Comput., 22 (1993), pp. 994-1005.
-
(1993)
SIAM J. Comput.
, vol.22
, pp. 994-1005
-
-
Feigenbaum, J.1
Fortnow, L.2
-
10
-
-
84858935906
-
Balanced NP sets
-
L. FORTNOW, Balanced NP sets, Computational Complexity Weblog, 2003, available online at http://weblog.fortnow.com/archive/2003_09_07_archive.html.
-
(2003)
Computational Complexity Weblog
-
-
Fortnow, L.1
-
11
-
-
0003205419
-
A sample of samplers - A computational perspective on sampling (survey)
-
Electronic Colloquium on Computational Complexity (ECCC)
-
O. GOLDREICH, A sample of samplers - A computational perspective on sampling (survey), Technical report TR97-020, Electronic Colloquium on Computational Complexity (ECCC), 1997.
-
(1997)
Technical Report
, vol.TR97-020
-
-
Goldreich, O.1
-
12
-
-
0011247227
-
Modern cryptography, probabilistic proofs, and pseudorandomness
-
Springer-Verlag, Berlin
-
O. GOLDREICH, Modern Cryptography, Probabilistic Proofs, and Pseudorandomness, Algorithms Combin. 17, Springer-Verlag, Berlin, 1999.
-
(1999)
Algorithms Combin.
, vol.17
-
-
Goldreich, O.1
-
13
-
-
0003691180
-
-
Cambridge University Press, Cambridge, UK
-
O. GOLDREICH, Foundations of Cryptography: Volume 1, Basic Tools, Cambridge University Press, Cambridge, UK, 2001.
-
(2001)
Foundations of Cryptography: Volume 1, Basic Tools
, vol.1
-
-
Goldreich, O.1
-
14
-
-
0024868772
-
A hard-core predicate for all one-way functions
-
Seattle, WA, ACM, New York
-
O. GOLDREICH AND L. A. LEVIN, A hard-core predicate for all one-way functions, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, 1989, ACM, New York, pp. 25-32.
-
(1989)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing
, pp. 25-32
-
-
Goldreich, O.1
Levin, L.A.2
-
15
-
-
2442638659
-
On Yao's XOR lemma
-
Electronic Colloquium on Computational Complexity
-
O. GOLDREICH, N. NISAN, AND A. WIGDERSON, On Yao's XOR Lemma, Technical Report TR95-050, Electronic Colloquium on Computational Complexity, 1995, available online at http://www.eccc.uni-trier.de/eccc.
-
(1995)
Technical Report
, vol.TR95-050
-
-
Goldreich, O.1
Nisan, N.2
Wigderson, A.3
-
16
-
-
35048863410
-
Fooling parity tests with parity gates
-
Proceedings of the Eighth International Workshop on Randomization and Computation (RANDOM), Springer-Verlag, New York
-
D. GUTFREUND AND E. VIOLA, Fooling parity tests with parity gates, in Proceedings of the Eighth International Workshop on Randomization and Computation (RANDOM), Lecture Notes in Comput. Sci. 3122, Springer-Verlag, New York, 2004, pp. 381-392.
-
(2004)
Lecture Notes in Comput. Sci.
, vol.3122
, pp. 381-392
-
-
Gutfreund, D.1
Viola, E.2
-
17
-
-
4544286907
-
Using nondeterminism to amplify hardness
-
Chicago, IL, 2004, ACM, New York
-
A. HEALY, S. VADHAN, AND E. VIOLA, Using nondeterminism to amplify hardness, in Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, Chicago, IL, 2004, ACM, New York, pp. 192-201.
-
Proceedings of the 36th Annual ACM Symposium on the Theory of Computing
, pp. 192-201
-
-
Healy, A.1
Vadhan, S.2
Viola, E.3
-
19
-
-
0029227950
-
A personal view of average-case complexity
-
WI, 1995, IEEE Press, Piscataway, NJ
-
R. IMPAGLIAZZO, A personal view of average-case complexity, in Proceedings of the 10th Annual Structure in Complexity Theory Conference, Milwaukee, WI, 1995, IEEE Press, Piscataway, NJ, 1995, pp. 134-147.
-
(1995)
Proceedings of the 10th Annual Structure in Complexity Theory Conference, Milwaukee
, pp. 134-147
-
-
Impagliazzo, R.1
-
20
-
-
0030706544
-
P = BPP if e requires exponential circuits: Derandomizing the XOR lemma
-
El Paso, TX, ACM, New York
-
R. IMPAGLIAZZO AND A. WIGDERSON, P = BPP if E requires exponential circuits: Derandomizing the XOR lemma, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, ACM, New York, pp. 220-229.
-
(1997)
Proceedings of the 29th Annual ACM Symposium on Theory of Computing
, pp. 220-229
-
-
Impagliazzo, R.1
Wigderson, A.2
-
21
-
-
0035734550
-
Randomness vs. time: Derandomization under a uniform assumption
-
R. IMPAGLIAZZO AND A. WIGDERSON, Randomness vs. time: Derandomization under a uniform assumption, J. Comput. System Sci., 63 (2001), pp. 672-688.
-
(2001)
J. Comput. System Sci.
, vol.63
, pp. 672-688
-
-
Impagliazzo, R.1
Wigderson, A.2
-
22
-
-
0024140061
-
The influence of variables on Boolean functions
-
White Plains, New York, IEEE Press, Piscataway, NJ
-
J. KAHN, G. KALAI, AND N. LINIAL, The influence of variables on Boolean functions (extended abstract), in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, IEEE Press, Piscataway, NJ, 1988, pp. 68-80.
-
(1988)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science
, pp. 68-80
-
-
Kahn, J.1
Kalai, G.2
Linial, N.3
-
23
-
-
0038290332
-
Boosting and hard-core sets
-
A. KLIVANS AND R. A. SERVEDIO, Boosting and hard-core sets, Machine Learning, 53 (2003), pp. 217-238.
-
(2003)
Machine Learning
, vol.53
, pp. 217-238
-
-
Klivans, A.1
Servedio, R.A.2
-
24
-
-
0022663555
-
Average case complete problems
-
L. A. LEVIN, Average case complete problems, SIAM J. Comput., 15 (1986), pp. 285-286.
-
(1986)
SIAM J. Comput.
, vol.15
, pp. 285-286
-
-
Levin, L.A.1
-
26
-
-
26944446285
-
On the complexity of hardness amplification
-
San Jose, CA, IEEE Press, Piscataway, NJ
-
C.-J. LU, S.-C. TSAI, AND H.-L. WU, On the complexity of hardness amplification, in Proceedings of the 20th Annual IEEE Conference on Computational Complexity, San Jose, CA, IEEE Press, Piscataway, NJ, 2005, pp. 170-182.
-
(2005)
Proceedings of the 20th Annual IEEE Conference on Computational Complexity
, pp. 170-182
-
-
Lu, C.-J.1
Tsai, S.-C.2
Wu, H.-L.3
-
27
-
-
0141738444
-
On the noise sensitivity of monotone functions
-
E. MOSSEL AND R. O'DONNELL, On the noise sensitivity of monotone functions, Random Struct. Algorithms, 23 (2003), pp. 333-350.
-
(2003)
Random Struct. Algorithms
, vol.23
, pp. 333-350
-
-
Mossel, E.1
O'Donnell, R.2
-
28
-
-
0008827213
-
Pseudorandom bits for constant depth circuits
-
N. NISAN, Pseudorandom bits for constant depth circuits, Combinatorica, 11 (1991), pp. 63-70.
-
(1991)
Combinatorica
, vol.11
, pp. 63-70
-
-
Nisan, N.1
-
29
-
-
0000947929
-
Pseudorandom generators for space-bounded computation
-
N. NISAN, Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), pp. 449-461.
-
(1992)
Combinatorica
, vol.12
, pp. 449-461
-
-
Nisan, N.1
-
31
-
-
2942702375
-
Hardness amplification within NP
-
R. O'DONNELL, Hardness amplification within NP, J. Comput. System Sci., 69 (2004), pp. 68-94.
-
(2004)
J. Comput. System Sci.
, vol.69
, pp. 68-94
-
-
O'Donnell, R.1
-
32
-
-
27844593208
-
Simple extractors for all min-entropies and a new pseudorandom generator
-
R. SHALTIEL AND C. UMANS, Simple extractors for all min-entropies and a new pseudorandom generator, J. ACM, 52 (2005), pp. 172-216.
-
(2005)
J. ACM
, vol.52
, pp. 172-216
-
-
Shaltiel, R.1
Umans, C.2
-
33
-
-
0035276434
-
Pseudorandom generators without the XOR lemma
-
M. SUDAN, L. TREVISAN, AND S. VADHAN, Pseudorandom generators without the XOR lemma, J. Comput. System Sci., 62 (2001), pp. 236-266.
-
(2001)
J. Comput. System Sci.
, vol.62
, pp. 236-266
-
-
Sudan, M.1
Trevisan, L.2
Vadhan, S.3
-
34
-
-
0344981500
-
List decoding using the XOR lemma
-
Cambridge, MA, 2003, IEEE Press, Piscataway, NJ
-
L. TREVISAN, List decoding using the XOR lemma, in Proceedings of the 44th Annual Symposium on Foundations of Computer Science, Cambridge, MA, 2003, IEEE Press, Piscataway, NJ, 2003, pp. 126-135.
-
(2003)
Proceedings of the 44th Annual Symposium on Foundations of Computer Science
, pp. 126-135
-
-
Trevisan, L.1
-
35
-
-
0036292526
-
Pseudorandomness and average-case complexity via uniform reductions
-
Montreal, QC, IEEE Press, Piscataway, NJ
-
L. TREVISAN AND S. VADHAN, Pseudorandomness and average-case complexity via uniform reductions, in Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montreal, QC, IEEE Press, Piscataway, NJ, 2002, pp. 129-138.
-
(2002)
Proceedings of the 17th Annual IEEE Conference on Computational Complexity
, pp. 129-138
-
-
Trevisan, L.1
Vadhan, S.2
-
36
-
-
0142027847
-
Pseudo-random generators for all hardnesses
-
C. UMANS, Pseudo-random generators for all hardnesses, J. Comput. System Sci., 67 (2003), pp. 419-440.
-
(2003)
J. Comput. System Sci.
, vol.67
, pp. 419-440
-
-
Umans, C.1
-
37
-
-
15244355932
-
The complexity of constructing pseudorandom generators from hard functions
-
E. VIOLA, The complexity of constructing pseudorandom generators from hard functions, Comput. Complexity, 13 (2004), pp. 147-188.
-
(2004)
Comput. Complexity
, vol.13
, pp. 147-188
-
-
Viola, E.1
-
38
-
-
27644449284
-
On constructing parallel pseudorandom generators from one-way functions
-
San Jose, CA, IEEE Press, Piscataway, NJ
-
E. VIOLA, On constructing parallel pseudorandom generators from one-way functions, in Proceedings of the 20th Annual IEEE Conference on Computational Complexity, San Jose, CA, IEEE Press, Piscataway, NJ, 2005, pp. 183-197.
-
(2005)
Proceedings of the 20th Annual IEEE Conference on Computational Complexity
, pp. 183-197
-
-
Viola, E.1
-
39
-
-
0020301290
-
Theory and applications of trapdoor functions
-
Chicago, IL, IEEE
-
A. C. YAO, Theory and applications of trapdoor functions (extended abstract), in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, IEEE, 1982, pp. 80-91.
-
(1982)
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
, pp. 80-91
-
-
Yao, A.C.1
|