"On the Hardness of Satisfiability with Bounded Occurrences in the ..."

Ishay Haviv, Oded Regev, Amnon Ta-Shma (2007)

> Home

Details and statistics

DOI: 10.4086/TOC.2007.V003A003

access: open

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/HavivRT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/HavivRT07
Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory Comput. 3(1): 45-60 (2007)

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.