Steven Rudich

Available identifiers

Publication	Date of Publication	Type
Weakly learning DNF and characterizing statistical query learning using Fourier analysis	2016-09-01	Paper
Natural proofs	2016-09-01	Paper
On the (im)possibility of obfuscating programs	2014-02-17	Paper
Fast learning of \(k\)-term DNF formulas with queries.	2008-12-21	Paper
Learning a Hidden Matching	2005-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4650566	2005-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4783716	2002-12-08	Paper
Communication complexity towards lower bounds on circuit depth	2002-06-17	Paper
Reducing the complexity of reductions	2002-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q4527042	2001-03-01	Paper
Reductions in circuit complexity: An isomorphism theorem and a gap theorem	1999-09-29	Paper
Products and Help Bits in Decision Trees	1999-02-22	Paper
Natural proofs	1997-12-03	Paper
The Wakeup Problem	1997-06-09	Paper
Representing Boolean functions as polynomials modulo composite numbers	1995-04-06	Paper
The expressive power of voting polynomials	1994-08-11	Paper
On dice and coins: Models of computation for random generation	1993-08-30	Paper
https://portal.mardi4nfdi.de/entity/Q4035723	1993-05-18	Paper
Implicat Representation of Graphs	1993-04-01	Paper
https://portal.mardi4nfdi.de/entity/Q5750403	1990-01-01	Paper
On the complexity of ranking	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4732126	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3801092	1988-01-01	Paper

This page was built for person: Steven Rudich