Prediction-Preserving Reducibility

[1]  Michael Kearns,et al.  Computational complexity of machine learning , 1990, ACM distinguished dissertations.

[2]  Leonard Pitt,et al.  On the necessity of Occam algorithms , 1990, STOC '90.

[3]  Dana Angluin.  Equivalence queries and approximate fingerprints , 1989, COLT '89.

[4]  Robert E. Schapire,et al.  The Strength of Weak Learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Manfred K. Warmuth.  Towards Representation Independence in PAC Learning , 1989, AII.

[6]  Leonard Pitt,et al.  Inductive Inference, DFAs, and Computational Complexity , 1989, AII.

[7]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[8]  Leonard Pitt,et al.  The minimum consistent DFA problem cannot be approximated within any polynomial , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[9]  M. Kearns,et al.  Crytographic limitations on learning Boolean formulae and finite automata , 1989, STOC '89.

[10]  David Haussler,et al.  Learning decision trees from random examples , 1988, COLT '88.

[11]  Umesh V. Vazirani,et al.  On the learnability of finite automata , 1988, Annual Conference Computational Learning Theory.

[12]  David Haussler,et al.  Equivalence of models for polynomial learnability , 1988, COLT '88.

[13]  Leslie G. Valiant,et al.  A general lower bound on the number of examples needed for learning , 1988, COLT '88.

[14]  David Haussler,et al.  Predicting (0, 1)-functions on randomly drawn points , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[15]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[16]  David Haussler,et al.  Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework , 1988, Artif. Intell..

[17]  Stuart J. Russell.  Tree-Structured Bias , 1988, AAAI.

[18]  Hugo Krawczyk,et al.  On the existence of pseudorandom generators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[19]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[20]  Leonid A. Levin,et al.  One way functions and pseudorandom generators , 1987, Comb..

[21]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[22]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[23]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[24]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[25]  Leslie G. Valiant,et al.  On the learnability of Boolean formulae , 1987, STOC.

[26]  M. Kearns,et al.  Recent Results on Boolean Concept Learning , 1987 .

[27]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[28]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[29]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[30]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[31]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[32]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[33]  P. Assouad.  Densité et dimension , 1983 .

[34]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[35]  Walter L. Ruzzo,et al.  On uniform circuit complexity , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[36]  Richard J. Lipton,et al.  Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[37]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[38]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[39]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[40]  Ivan Hal Sudborough,et al.  On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[41]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[42]  John E. Savage,et al.  The Complexity of Computing , 1976 .

[43]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[44]  I. H. Sudborough.  On Tape-Bounded Complexity Classes and Multihead Finite Automata , 1973, J. Comput. Syst. Sci..

[45]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[46]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[47]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[48]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .