BraunsteinA., MézardM., ZecchinaR.
Abstract
We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be most difficult when ...
OpenAlex reports 250 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be most difficult when ...
Key concepts: Satisfiability, Maximum satisfiability problem, Boolean satisfiability problem, Combinatorics, Algorithm, Value (mathematics), Mathematics, Discrete mathematics