"On the Subexponential Time Complexity of CSP."

Iyad A. Kanj, Stefan Szeider (2013)

> Home

Details and statistics

DOI: 10.1609/AAAI.V27I1.8609

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/KanjS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/KanjS13
Iyad A. Kanj, Stefan Szeider:
On the Subexponential Time Complexity of CSP. AAAI 2013: 459-465

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.