Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/cp/JonssonLO21
%A Jonsson, Peter
%A Lagerkvist, Victor
%A Ordyniak, Sebastian
%B CP
%D 2021
%E Michel, Laurent D.
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 32:1-32:20
%T Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors.
%U http://dblp.uni-trier.de/db/conf/cp/cp2021.html#JonssonLO21
%V 210
%@ 978-3-95977-211-2
@inproceedings{conf/cp/JonssonLO21,
added-at = {2022-04-09T00:00:00.000+0200},
author = {Jonsson, Peter and Lagerkvist, Victor and Ordyniak, Sebastian},
biburl = {https://www.bibsonomy.org/bibtex/245530496771c6fc10e8f2e2cd411042b/dblp},
booktitle = {CP},
crossref = {conf/cp/2021},
editor = {Michel, Laurent D.},
ee = {https://doi.org/10.4230/LIPIcs.CP.2021.32},
interhash = {eb3d9e0551835a9cabeac744b82a1143},
intrahash = {45530496771c6fc10e8f2e2cd411042b},
isbn = {978-3-95977-211-2},
keywords = {dblp},
pages = {32:1-32:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-08-26T07:41:24.000+0200},
title = {Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors.},
url = {http://dblp.uni-trier.de/db/conf/cp/cp2021.html#JonssonLO21},
volume = 210,
year = 2021
}