Amanote Research
Register
Sign In
The Complexity of DNF of Parities
doi 10.1145/2840728.2840734
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2016
Authors
Gil Cohen
Igor Shinkar
Publisher
ACM Press
Related search
Learnability of DNF With Representation-Specific Queries
Disjoint DNF Tautologies With Conflict Bound Two
Journal on Satisfiability, Boolean Modeling and Computation
The Minimum Equivalent DNF Problem and Shortest Implicants
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
Projective DNF Formulae and Their Revision
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On Learning Monotone DNF Under Product Distributions
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
On Learning Monotone DNF Under Product Distributions
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Robust K-DNF Learning via Inductive Belief Merging
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Analysis and Forecasting of Price Parities for Vegetables in Serbia
Price Parities for Vegetables in Serbia - Analysis and Forecasting
Contemporary Agriculture
