"On the Subexponential-Time Complexity of CSP."

Ronald de Haan, Iyad A. Kanj, Stefan Szeider (2015)

> Home

Details and statistics

DOI: 10.1613/JAIR.4540

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jair/HaanKS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jair/HaanKS15
Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On the Subexponential-Time Complexity of CSP. J. Artif. Intell. Res. 52: 203-234 (2015)

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.