"Satisfiability allows no nontrivial sparsification unless the ..."

Holger Dell, Dieter van Melkebeek (2010)

> Home

Details and statistics

DOI: 10.1145/1806689.1806725

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/DellM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/DellM10
Holger Dell, Dieter van Melkebeek:
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. STOC 2010: 251-260

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.