"Complexity and Algorithms for Well-Structured k-SAT Instances."

Konstantinos Georgiou, Periklis A. Papakonstantinou (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-79719-7_10

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sat/GeorgiouP08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/GeorgiouP08
Konstantinos Georgiou, Periklis A. Papakonstantinou:
Complexity and Algorithms for Well-Structured k-SAT Instances. SAT 2008: 105-118

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.