%0 Conference Paper %1 conf/cp/JonssonL15 %A Jonsson, Peter %A Lagerkvist, Victor %B CP %D 2015 %E Pesant, Gilles %I Springer %K dblp %P 183-199 %T Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. %U http://dblp.uni-trier.de/db/conf/cp/cp2015.html#JonssonL15 %V 9255 %@ 978-3-319-23218-8

@inproceedings{conf/cp/JonssonL15, added-at = {2017-05-17T00:00:00.000+0200}, author = {Jonsson, Peter and Lagerkvist, Victor}, biburl = {https://www.bibsonomy.org/bibtex/289a861489402a1c348847822d083998b/dblp}, booktitle = {CP}, crossref = {conf/cp/2015}, editor = {Pesant, Gilles}, ee = {https://doi.org/10.1007/978-3-319-23219-5_14}, interhash = {a0071418d60fb908ab242d14f64fb69d}, intrahash = {89a861489402a1c348847822d083998b}, isbn = {978-3-319-23218-8}, keywords = {dblp}, pages = {183-199}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:20:12.000+0200}, title = {Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs.}, url = {http://dblp.uni-trier.de/db/conf/cp/cp2015.html#JonssonL15}, volume = 9255, year = 2015 }