Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
k-CNF
Description:
A Boolean formula in conjunctive normal form whose clauses contain at most k literals, studied in logic, complexity theory, and learning.
Primary topic:
Complexity and Algorithms in Graphs (32%)
Related topics:
Complexity and Algorithms in Graphs (32%),
Constraint Satisfaction and Optimization (23%),
Advanced Graph Theory Research (21%),
Machine Learning and Algorithms (8%)
OpenAlex ID:
keywords/k-cnf
Learning Decision Lists
1987
·
Ronald L. Rivest
·
Machine Learning
·
1,072
PDF
A general lower bound on the number of examples needed for learning
1989
·
Andrzej Ehrenfeucht
, David Haussler
, et al.
·
Information and Computation
·
489
Complexity of k-SAT
2003
·
R. Impagliazzo
, R. Paturi
·
IEEE Conference on Computational Complexity (CCC)
·
246
Satisfiability Coding Lemma
2002
·
R. Paturi
, P. Pudlak
, et al.
·
Annual Symposium on Foundations of Computer Science
·
191
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart
2002
·
Schöning
·
Algorithmica
·
154
Fixed-parameter complexity in AI and nonmonotonic reasoning
2002
·
Georg Gottlob
, Francesco Scarcello
, et al.
·
Artificial Intelligence
·
132
PDF
A Satisfiability Algorithm for AC 0
2012
·
Russell Impagliazzo
, William Matthews
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
117
PDF
Learning Boolean Functions in an Infinite Attribute Space
1992
·
Avrim Blum
·
Machine Learning
·
93
PDF
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
2007
·
Chris Calabro
, Russell Impagliazzo
, et al.
·
Journal of Computer and System Sciences
·
85
PDF
Converting Online Algorithms to Local Computation Algorithms
2012
·
Yishay Mansour
, Aviad Rubinstein
, et al.
·
Lecture notes in computer science
·
71
PDF
Approximating the Satisfiability Threshold for Random k - XOR -formulas
2003
·
NADIA CREIGNOU
, HERVÉ DAUDÉ
, et al.
·
Combinatorics Probability Computing
·
61
PDF
Learning boolean functions in an infinite attribute space
1990
·
A. Blum
·
ACM Symposium on Theory of Computing (STOC)
·
52
PDF
A Note on Approximate Counting for k-DNF
2004
·
Luca Trevisan
·
Lecture notes in computer science
·
47
On detecting global predicates in distributed computations
2002
·
N. Mittal
, V.K. Garg
·
Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems
·
43
An exact algorithm for the Boolean connectivity problem for k -CNF
2011
·
Kazuhisa Makino
, Suguru Tamaki
, et al.
·
Theoretical Computer Science
·
36
PDF
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
2006
·
Evgeny Dantsin
, Alexander Wolpert
·
Lecture notes in computer science
·
32
Pac-learning non-recursive prolog clauses
1995
·
William W. Cohen
·
Artificial Intelligence
·
31
PDF
Tight Thresholds for The Pure Literal Rule
1997
·
Michael Mitzenmacher
·
30
The complexity of unique k-SAT: an isolation lemma for k-CNFs
2004
·
C. Calabro
, R. Impagliazzo
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
26
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster
2017
·
Scheder, Dominik
, Steinberger, John P.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
25
PDF
MEGA---the maximizing expected generalization algorithm for learning complex query concepts
2003
·
Edward Chang
, Beitao Li
·
ACM Transactions on Information Systems
·
24
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning
1999
·
Georg Gottlob
, Francesco Scarcello
, et al.
·
Lecture notes in computer science
·
24
Deterministic counting Lovász local lemma beyond linear programming
2023
·
Kun He
, Chunyang Wang
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
23
PDF
Strong ETH holds for regular resolution
2013
·
Christopher Beck
, Russell Impagliazzo
·
ACM Symposium on Theory of Computing (STOC)
·
23
Untitled
1999
·
Ramamohan Paturi
, Pavel Pudlak
, et al.
·
Chicago Journal of Theoretical Computer Science
·
20
PDF
Show more works
View as search
Works count:
101
Citation count:
3,496
Year
Topic
Type