Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
clause density
Description:
A measure of syntactic complexity based on the number of clauses relative to words or other text units.
Primary topic:
Constraint Satisfaction and Optimization (61%)
Related topics:
Constraint Satisfaction and Optimization (61%),
Advanced Graph Theory Research (9%)
OpenAlex ID:
keywords/clause-density
Solving satisfiability in less than 2n steps
1985
·
B. Monien
, E. Speckenmeyer
·
Discrete Applied Mathematics
·
291
The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
2004
·
Dimitris Achlioptas
, Yuval Peres
·
Journal of the American Mathematical Society
·
268
PDF
Mick Gets Some (the Odds Are on His Side)
1992
·
Vašek Chvátal
, Bruce A. Reed
·
OpenGrey (Institut de l'Information Scientifique et Technique)
·
247
The threshold for random k-SAT is 2 k (ln 2 - O(k))
2003
·
Dimitris Achlioptas
, Yuval Peres
·
ACM Symposium on Theory of Computing (STOC)
·
206
Proof of the Satisfiability Conjecture for Large k
2015
·
Jian Ding
, Allan Sly
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
196
On the satisfiability and maximum satisfiability of random 3-CNF formulas
1993
·
Andrei Broder
, Alan Frieze
, et al.
·
Symposium on Discrete Algorithms
·
181
Probing for quantum speedup in spin-glass problems with planted solutions
2015
·
Itay Hen
, Joshua Job
, et al.
·
Physical Review A
·
177
PDF
Instability of one-step replica-symmetry-broken phase in satisfiability problems
2004
·
Andrea Montanari
, Giorgio Parisi
, et al.
·
Journal of Physics A Mathematical and General
·
145
PDF
The asymptotic order of the random k-SAT threshold
2003
·
D. Achlioptas
, C. Moore
·
Annual Symposium on Foundations of Computer Science
·
138
A Duality between Clause Width and Clause Density for SAT
2006
·
C. Calabro
, R. Impagliazzo
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
136
Proof of the satisfiability conjecture for large $k$
2022
·
Jian Ding
, Allan Sly
, et al.
·
Annals of Mathematics
·
132
PDF
Measures of Syntax in School-Age Children and Adolescents
1995
·
Cheryl M. Scott
, Sharon L. Stokes
·
Language Speech and Hearing Services in Schools
·
122
Strongly refuting random CSPs below the spectral threshold
2017
·
Prasad Raghavendra
, Satish Rao
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
110
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
2002
·
Alexis C. Kaporis
, Lefteris M. Kirousis
, et al.
·
Lecture notes in computer science
·
107
$(2+\varepsilon)$-Sat Is NP-hard
2017
·
Per Austrin
, Venkatesan Guruswami
, et al.
·
SIAM Journal on Computing
·
102
The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials
2022
·
Guy Bresler
, Brice Huang
·
Annual Symposium on Foundations of Computer Science
·
97
PDF
Optimal myopic algorithms for random 3-SAT
2002
·
D. Achioptas
, G.B. Sorkin
·
Annual Symposium on Foundations of Computer Science
·
95
CNF-Satisfiability Test by Counting and Polynomial Average Time
1989
·
Kazuo Iwama
·
SIAM Journal on Computing
·
91
Random k-Sat: A Tight Threshold For Moderately Growing k
2005
·
Alan Frieze*
, Nicholas C. Wormald†
·
COMBINATORICA
·
84
Evaluating spam filters and Stylometric Detection of AI-generated phishing emails
2025
·
Chidimma Opara
, Paolo Modesti
, et al.
·
Expert Systems with Applications
·
80
Space complexity of random formulae in resolution
2003
·
Eli Ben‐Sasson
, Nicola Galesi
·
Random Structures and Algorithms
·
78
Pairs of SAT-assignments in random Boolean formulæ
2008
·
Hervé Daudé
, Marc Mézard
, et al.
·
Theoretical Computer Science
·
75
PDF
Refuting Smoothed 3CNF Formulas
2007
·
Uriel Feige
·
Annual Symposium on Foundations of Computer Science
·
75
Max 2-SAT with up to 108 qubits
2014
·
Siddhartha Santra
, Gregory Quiroz
, et al.
·
New Journal of Physics
·
73
PDF
A threshold for unsatisfiability
1992
·
Andreas Goerdt
·
Lecture notes in computer science
·
73
Show more works
View as search
Works count:
210
Citation count:
5,048
Year
Topic
Type