Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm to learn read-once threshold formulas, and transformations between learning models

From MaRDI portal
Publication:1327594
Jump to:navigation, search

DOI10.1007/BF01205054zbMath0806.68050MaRDI QIDQ1327594

Lisa Hellerstein, Nader H. Bshouty, Marek Karpinski, Thomas R. Hancock

Publication date: 19 June 1994

Published in: Computational Complexity (Search for Journal in Brave)


zbMATH Keywords

membership queryblack box interpolationBoolean threshold functions


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)


Related Items

Exact learning from an honest teacher that answers membership queries, Independence and port oracles for matroids, with an application to computational learning theory



Cites Work

  • Learning regular sets from queries and counterexamples
  • On read-once threshold formulae and their randomized decision tree complexity
  • Asking questions to minimize errors
  • Learning read-once formulas with queries
  • Learning Arithmetic Read-Once Formulas
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1327594&oldid=13453761"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki