"The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs."

Chris Calabro et al. (2003)

> Home

Details and statistics

DOI: 10.1109/CCC.2003.1214416

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  authority control:
- export record
  dblp key:
  - conf/coco/CalabroIKP03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/CalabroIKP03
Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi:
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. CCC 2003: 135-

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.