A dichotomy theorem for learning quantified Boolean formulas
From MaRDI portal
Publication:1964325
DOI10.1023/A:1007582729656zbMath0941.68064OpenAlexW3003589747MaRDI QIDQ1964325
Publication date: 1999
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1007582729656
Related Items (4)
Learning intersection-closed classes with signatures ⋮ On the non-efficient PAC learnability of conjunctive queries ⋮ Learnability of quantified formulas. ⋮ Unnamed Item
This page was built for publication: A dichotomy theorem for learning quantified Boolean formulas