Searching for authors named "Steven Rudich" – sorted by Relevance.
-
Super-bits, Demi-bits, and NP/qpoly-natural Proofs
- Super-bits, Demi-bits, and N ~ P =qpoly-natural Proofs Steven Rudich Computer Science
- Add To MetaCart
-
Fast Learning of k-Term DNF Formulas with Queries
- Carnegie Mellon University Pittsburgh, PA 15213 Steven Rudich School of Computer Science Carnegie Mellon
- Cited by 49 (3 self) – Add To MetaCart
-
Limits on the Provable Consequences of One-way Permutations
- Division University of California at Berkeley Berkeley, California 94720 Steven Rudich* Computer Science
- Cited by 106 (0 self) – Add To MetaCart
-
Products and Help Bits in Decision Trees
- Products and Help Bits in Decision Trees Preliminary Version Noam Nisan Steven Rudich y
- Cited by 16 (0 self) – Add To MetaCart
-
Communication Complexity: Towards Lower Bounds on Circuit Depth
- y-- Steven Rudich z-- Jir'i Sgall x-- August 8, 2000 Abstract Karchmer, Raz, and Wigderson
- Cited by 10 (0 self) – Add To MetaCart
-
Implicit Representation of Graphs
- of Arizona Moni Naor IBM Research Division Almaden Research center Steven Rudich Computer Science Department
- Cited by 50 (0 self) – Add To MetaCart
-
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
- @(email omitted); allender@(email omitted); Steven Rudich Computer Science Department Carnegie Mellon University Pittsburgh, PA
- Cited by 21 (6 self) – Add To MetaCart
-
Natural Proofs
- Princeton, NJ 08540 and Steklov Mathematical Institute Vavilova 42, 117966, GSP--1 Moscow, RUSSIA Steven
- Cited by 122 (5 self) – Add To MetaCart
-
The Expressive Power of Voting Polynomials
- Steven Rudich x October 14, 1993 Abstract We consider the problem of approximating a Boolean function f
- Cited by 72 (9 self) – Add To MetaCart
-
Reducing the Complexity of Reductions
- @(email omitted); Toniann Pitassi x Dept. of Computer Science University of Arizona toni@(email omitted); Steven Rudich
- Cited by 22 (11 self) – Add To MetaCart

