Diagonalizations over polynomial time computable sets, Theoretical Computer Science, vol.51, issue.1-2, pp.177-204, 1987. ,
DOI : 10.1016/0304-3975(87)90053-3
URL : http://doi.org/10.1016/0304-3975(87)90053-3
Resource-bounded measure and randomness, Complexity, Logic and Recursion Theory, pp.1-47 ,
Resource bounded randomness and weakly complete problems, Theoretical Computer Science, vol.172, issue.1-2, pp.195-207, 1997. ,
DOI : 10.1016/S0304-3975(95)00260-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.9227
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question, SIAM Journal on Computing, vol.4, issue.4, pp.431-442, 1975. ,
DOI : 10.1137/0204037
Equivalence of Measures of Complexity Classes, SIAM Journal on Computing, vol.29, issue.1, pp.302-326, 1999. ,
DOI : 10.1137/S0097539796302269
The relative efficiency of propositional proof systems, The Journal of Symbolic Logic, vol.87, issue.01, pp.36-50, 1979. ,
DOI : 10.1007/BF01475439
The complexity of promise problems with applications to public-key cryptography, Information and Control, vol.61, issue.2, pp.159-173, 1984. ,
DOI : 10.1016/S0019-9958(84)80056-X
Separability and one-way functions, Computational Complexity, vol.11, issue.3-4, pp.137-157, 2002. ,
DOI : 10.1007/s00037-002-0173-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.8957
Reductions between disjoint NP-pairs. Information and Computation, pp.247-267, 2005. ,
Disjoint NP-Pairs, SIAM Journal on Computing, vol.33, issue.6, pp.1369-1416, 2004. ,
DOI : 10.1137/S0097539703425848
Survey of disjoint NP-pairs and relations to propositional proof systems, Theoretical Computer Science: Essays in Memory of Shimon Even, pp.241-253, 2006. ,
Canonical disjoint NP-pairs of propositional proof systems, Theoretical Computer Science, vol.370, issue.1-3, pp.60-73, 2007. ,
DOI : 10.1016/j.tcs.2006.10.006
The informational content of canonical disjoint NP-pairs, In COCOON LNCS, pp.307-317, 2007. ,
On Promise Problems: A Survey, Theoretical Computer Science: Essays in Memory of Shimon Even, pp.254-290, 2006. ,
DOI : 10.1007/11685654_12
Complexity measures for public-key cryptosystems, SIAM Journal on Computing, vol.11, pp.309-335, 1988. ,
Resource-bounded measure bibliography ,
Oracles for structural properties: The isomorphism problem and public-key cryptography, Journal of Computer and System Sciences, vol.44, issue.2, pp.287-301, 1992. ,
DOI : 10.1016/0022-0000(92)90023-C
Weak completeness in E and E2, Theoretical Computer Science, vol.143, issue.1, 1995. ,
DOI : 10.1016/0304-3975(95)80030-D
A dual version of Reimer's inequality and a proof of Rudich's conjecture, Proceedings 15th Annual IEEE Conference on Computational Complexity, pp.98-103, 2000. ,
DOI : 10.1109/CCC.2000.856739
Relative to a Random Oracle, NP Is Not Small, Journal of Computer and System Sciences, vol.53, issue.2, pp.235-250, 1996. ,
DOI : 10.1006/jcss.1996.0065
Genericity and randomness over feasible probability measures, Theoretical Computer Science, vol.207, issue.1, pp.245-259, 1998. ,
DOI : 10.1016/S0304-3975(98)00067-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.3609
Almost everywhere high nonuniform complexity, Journal of Computer and System Sciences, vol.44, issue.2, pp.220-258, 1992. ,
DOI : 10.1016/0022-0000(92)90020-J
URL : http://doi.org/10.1016/0022-0000(92)90020-j
The quantitative structure of exponential time, Complexity Theory Retrospective II, pp.225-254, 1997. ,
Twelve problems in resource-bounded measure, Current Trends in Theoretical Computer Science, entering the 21st century, pp.83-101, 2001. ,
On provably disjoint NP-pairs, BRICS Report Series, vol.1, issue.36, 1994. ,
DOI : 10.7146/brics.v1i36.21607
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3527
Complexity issues in cryptography, Computational complexity theory, pp.92-107, 1988. ,
DOI : 10.1090/psapm/038/1020811