Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Rudich, Steven - School of Computer Science, Carnegie Mellon University
Superbits, Demibits, and N ~ P =qpolynatural
The Expressive Power of Voting Polynomials
Communication Complexity Towards Lower Bounds on Circuit Depth
Limits on the Provable Consequences of Oneway Permutations.
Reducing the Complexity of Reductions # Manindra Agrawal +
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem \Lambda
To Nathan Congdon My first intellectual companion
Products and Help Bits in Decision Trees Noam Nisan \Lambda Steven Rudich y Michael Saks z
Fast Learning of kTerm DNF Formulas with Queries Avrim Blum \Lambda
Natural Proofs Alexander A. Razborov \Lambda
Representing Boolean Functions as Polynomials Modulo Composite Numbers