Work

Why almost all k-CNF formulas are easy

Year: 2007

Type: article

Authors: Amin Coja‐Oghlan, Michael Krivelevich, Dan Vilenchik

Institutions: Humboldt-Universität zu Berlin, Tel Aviv University

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W99448414

FWCI: 1.142

Cites: 24

Cited by: 11

Related to: 8