The Statistical Mechanics of k-Satisfaction

Kirkpatrick, Scott, Györgyi, Géza, Tishby, Naftali, Troyansky, Lidror

Dec-31-1994–Neural Information Processing Systems

The satisfiability of random CNF formulae with precisely k variables per clause ("k-SAT") is a popular testbed for the performance of search algorithms. Formulae have M clauses from N variables, randomly negated, keeping the ratio a M / N fixed.

formulae, statistical mechanics, threshold, (14 more...)

Neural Information Processing Systems

Dec-31-1994

Conferences PDF

Add feedback

Country:
- North America > United States (0.04)
- Europe
  - Slovakia (0.04)
  - Czechia > Prague (0.04)
  - Hungary > Budapest
    - Budapest (0.04)
- Asia
  - Singapore (0.04)
  - Middle East > Israel
    - Jerusalem District > Jerusalem (0.05)

Technology:
- Information Technology > Artificial Intelligence > Representation & Reasoning > Search (0.48)

Duplicate Docs Excel Report

Title
The Statistical Mechanics of k-Satisfaction
The Statistical Mechanics of k-Satisfaction

Similar Docs Excel Report more

Title	Similarity	Source
None found