scientific article; zbMATH DE number 1453047

zbMATH Open0955.68093MaRDI QIDQ4955320FDOQ4955320

Authors: Víctor Dalmau 

Publication date: 24 July 2000

Title of this publication is not available (Why is that?)

Recommendations

• A dichotomy theorem for learning quantified Boolean formulas
• Learning Boolean read-once formulas over generalized bases
• Algorithmic Learning Theory
• Learning Boolean formulas

zbMATH Keywords

Boolean formulasPAC-predictable even

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Cited In (12)

• Title not available (Why is that?)
• Boolean autoencoders and hypercube clustering complexity
• Learnability of quantified formulas.
• Learning Boolean functions with queries
• A note on the complexity of Boolean concepts
• Cryptographic limitations on learning Boolean formulae and finite automata
• A dichotomy theorem for learning quantified Boolean formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• Derandomized learning of Boolean functions over finite abelian groups
• Learning Boolean specifications
• Algorithmic Learning Theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955320)