Entry Board:1992:NOA from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Board:1992:NOA,
  author =       "R. Board and L. Pitt",
  title =        "On the necessity of {Occam} algorithms",
  journal =      j-THEOR-COMP-SCI,
  volume =       "100",
  number =       "1",
  pages =        "157--184",
  day =          "22",
  month =        jun,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1240 (Adaptive system theory); C4240P (Parallel
                 programming and algorithm theory); C6140D (High level
                 languages)",
  corpsource =   "Div. of Res. and Stat., Federal Reserve Board,
                 Washington, DC, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "closure under exception lists; concept learning from
                 examples; data compression; distribution-independent
                 model; learning systems; Occam; Occam algorithms;
                 PAC-learnability; parallel algorithms; probability
                 approximately correct learning; randomized
                 polynomial-time algorithm; sufficient condition",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries