"Approximating Satisfiable Satisfiability Problems."

Luca Trevisan (2000)

> Home

Details and statistics

DOI: 10.1007/S004530010035

access: closed

type: Journal Article

metadata version: 2025-02-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Trevisan00a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Trevisan00a
Luca Trevisan:
Approximating Satisfiable Satisfiability Problems. Algorithmica 28(1): 145-172 (2000)

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.