Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Random Constraint Satisfaction Problem That Seems Hard for DPLL."

Harold S. Connamacher (2004)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ satisfiability.org (open access)
- export record
  dblp key:
  - conf/sat/Connamacher04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/Connamacher04
Harold S. Connamacher:
A Random Constraint Satisfaction Problem That Seems Hard for DPLL. SAT 2004

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.