"Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time."

Rocco A. Servedio, Li-Yang Tan (2017)

> Home

Details and statistics

DOI: 10.1109/FOCS.2017.80

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  authority control:
- export record
  dblp key:
  - conf/focs/ServedioT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ServedioT17
Rocco A. Servedio, Li-Yang Tan:
Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time. FOCS 2017: 813-823

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.