From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Universal algebra and hardness results for constraint satisfaction problems.

B. Larose, и P. Tesson. Theor. Comput. Sci., 410 (18): 1629-1647 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Benoît Cordonnier

Non-Newtonian effects in silicate liquids and crystal bearing melts: implication for magma dynamicsB. Cordonnier. Uni München, (2009)

Benoît Mindzeng

Benoît Vaugon

Benoît Delahaye

Benoît Bertholon

Другие публикации лиц с тем же именем

Asking the Metaquestions in Constraint Tractability.H. Chen, и B. Larose. TOCT, 9 (3): 11:1-11:27 (2017)Universal Algebra and Hardness Results for Constraint Satisfaction Problems.B. Larose, и P. Tesson. ICALP, том 4596 из Lecture Notes in Computer Science, стр. 267-278. Springer, (2007)The Complexity of the List Homomorphism Problem for Graphs.L. Egri, A. Krokhin, B. Larose, и P. Tesson. STACS, том 5 из LIPIcs, стр. 335-346. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Universal algebra and hardness results for constraint satisfaction problems.B. Larose, и P. Tesson. Theor. Comput. Sci., 410 (18): 1629-1647 (2009)QCSP on Reflexive Tournaments.B. Larose, P. Markovic, B. Martin, D. Paulusma, S. Smith, и S. Zivný. ESA, том 204 из LIPIcs, стр. 58:1-58:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dismantlability, Connectedness, and Mixing in Relational Structures.R. Briceño, A. Bulatov, V. Dalmau, и B. Larose. ICALP, том 132 из LIPIcs, стр. 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.V. Dalmau, L. Egri, P. Hell, B. Larose, и A. Rafiey. LICS, стр. 487-498. IEEE Computer Society, (2015)A Characterisation of First-Order Constraint Satisfaction Problems.B. Larose, C. Loten, и C. Tardif. LICS, стр. 201-210. IEEE Computer Society, (2006)Algebra and the Complexity of Digraph CSPs: a Survey.B. Larose. The Constraint Satisfaction Problem, том 7 из Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.O. Klíma, B. Larose, и P. Tesson. MFCS, том 4162 из Lecture Notes in Computer Science, стр. 584-595. Springer, (2006)

BibSonomy

Disambiguation