"Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs."

Peter Jonsson, Victor Lagerkvist (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-319-23219-5_14

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cp/JonssonL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cp/JonssonL15
Peter Jonsson, Victor Lagerkvist:
Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. CP 2015: 183-199

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.