"On the Exact Complexity of Evaluating Quantified k -CNF."

Chris Calabro, Russell Impagliazzo, Ramamohan Paturi (2013)

> Home

Details and statistics

DOI: 10.1007/S00453-012-9648-0

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/CalabroIP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/CalabroIP13
Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k -CNF. Algorithmica 65(4): 817-827 (2013)

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.