Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
DNF formulas
Description:
Logical formulas expressed in disjunctive normal form, as disjunctions of conjunctions of variables or their negations.
Primary topic:
Complexity and Algorithms in Graphs (36%)
Related topics:
Complexity and Algorithms in Graphs (36%),
Machine Learning and Algorithms (27%)
OpenAlex ID:
keywords/dnf-formulas
PAC Learning from Positive Statistical Queries
1998
·
FranÇois Denis
·
Lecture notes in computer science
·
218
Oracles and Queries That Are Sufficient for Exact Learning
1996
·
Nader H. Bshouty
, Richard Cleve
, et al.
·
Journal of Computer and System Sciences
·
187
Testing for Concise Representations
2007
·
Ilias Diakonikolas
, Homin K. Lee
, et al.
·
Annual Symposium on Foundations of Computer Science
·
169
The Good Old Davis-Putnam Procedure Helps Counting Models
1999
·
E. Birnbaum
, E. L. Lozinskii
·
Journal of Artificial Intelligence Research
·
148
PDF
Polylogarithmic independence fools AC 0 circuits
2008
·
Mark Braverman
·
Journal of the ACM
·
117
How many queries are needed to learn?
1996
·
Lisa Hellerstein
, Krishnan Pillaipakkamnatt
, et al.
·
Journal of the ACM
·
106
PDF
Deterministic simulation of probabilistic constant depth circuits
1985
·
Miklos Ajtai
, Avi Wigderson
·
Annual Symposium on Foundations of Computer Science
·
96
Polylogarithmic Independence Can Fool DNF Formulas
2009
·
Louay M. J. Bazzi
·
SIAM Journal on Computing
·
95
Global optimization for satisfiability (SAT) problem
1994
·
Jun Gu
·
IEEE Transactions on Knowledge and Data Engineering
·
94
Property Testing
2008
·
Dana Ron
·
93
Deterministic approximate counting of depth-2 circuits
2002
·
M. Luby
, B. Velickovic
, et al.
·
Israel Symposium on Theory and Computing Systems (ISTCS)
·
90
Learning Boolean formulas
1994
·
Michael Kearns
, Ming Li
, et al.
·
Journal of the ACM
·
79
PDF
Learning DNF over the uniform distribution using a quantum example oracle
1995
·
Nader H. Bshouty
, Jeffrey C. Jackson
·
Conference on Learning Theory
·
78
PDF
Improved Pseudorandom Generators for Depth 2 Circuits
2010
·
Anindya De
, Omid Etesami
, et al.
·
Lecture notes in computer science
·
73
Efficient synthesis of feature models
2014
·
Steven She
, Uwe Ryssel
, et al.
·
Information and Software Technology
·
71
Testing for Concise Representations
2007
·
Ilias Diakonikolas
, Hsinyu Lee
, et al.
·
68
A Simple Proof of Bazzi’s Theorem
2009
·
Alexander Razborov
·
ACM Transactions on Computation Theory
·
67
DNF sparsification and a faster deterministic counting algorithm
2013
·
Parikshit Gopalan
, Raghu Meka
, et al.
·
Computational Complexity
·
66
PDF
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results
2021
·
Arenas, Marcelo
, Barceló, Pablo
, et al.
·
arXiv (Cornell University)
·
63
PDF
Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
1991
·
Ron M. Roth
, Gyora M. Benedek
·
SIAM Journal on Computing
·
60
The complexity of properly learning simple concept classes
2007
·
Misha Alekhnovich
, Mark Braverman
, et al.
·
Journal of Computer and System Sciences
·
58
PDF
Learning with Restricted Focus of Attention
1998
·
Shai Ben-David
, Eli Dichterman
·
Journal of Computer and System Sciences
·
58
Discrepancy sets and pseudorandom generators for combinatorial rectangles
2002
·
R. Armoni
, M. Saks
, et al.
·
Annual Symposium on Foundations of Computer Science
·
54
Quantum statistical query learning
2020
·
Arunachalam, Srinivasan
, Grilo, Alex B.
, et al.
·
arXiv (Cornell University)
·
53
PDF
The minimum equivalent DNF problem and shortest implicants
2002
·
C. Umans
·
Annual Symposium on Foundations of Computer Science
·
53
Show more works
View as search
Works count:
231
Citation count:
4,202
Year
Topic
Type