E-LIB Suche - Ergebnisse für: Madelaine, Florent

1

The Complexity of Quantified Constraints: Collapsibility, S..:

Carvalho, Catarina ; Madelaine, Florent ; Martin, Barnaby.
ACM Transactions on Computational Logic. 24 (2023) 1 - p. 1-26 , 2023

Link: https://doi.org/10.1145/..

2

A Proof of the Algebraic Tractability Conjecture for Monoto..:

Bodirsky, Manuel ; Madelaine, Florent ; Mottet, Antoine
SIAM Journal on Computing. 50 (2021) 4 - p. 1359-1409 , 2021

Link: https://doi.org/10.1137/..

3

Complexity of Conjunctive Regular Path Query Homomorphisms:

, In: Computing with Foresight and Industry; Lecture Notes in Computer Science,

Beaudou, Laurent ; Foucaud, Florent ; Madelaine, Florent.. - p. 108-119 , 2019

Link: https://doi.org/10.1007/..

4

A universal-algebraic proof of the complexity dichotomy for..:

, In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,

Bodirsky, Manuel ; Madelaine, Florent ; Mottet, Antoine - p. 105-114 , 2018

Link: https://dl.acm.org/doi/1..

5

Quantified Valued Constraint Satisfaction Problem:

, In: Lecture Notes in Computer Science; Principles and Practice of Constraint Programming,

Madelaine, Florent ; Secouard, Stéphane - p. 295-311 , 2018

Link: https://doi.org/10.1007/..

6

From Complexity to Algebra and Back: Digraph Classes, Colla..:

, In: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science,

Carvalho, Catarina ; Madelaine, Florent ; Martin, Barnaby - p. 462-474 , 2015

Link: https://doi.org/10.1109/..

7

From Complexity to Algebra and Back : Digraph Classes, C..:

, In: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),

Carvalho, Catarina ; Madelaine, Florent ; Martin, Barnaby - p. 462-474 , 2015

Link: https://dl.acm.org/doi/1..

8

Constraint Satisfaction with Counting Quantifiers:

Martin, Barnaby ; Madelaine, Florent ; Stacho, Juraj
SIAM Journal on Discrete Mathematics. 29 (2015) 2 - p. 1065-1113 , 2015

Link: https://doi.org/10.1137/..

9

The Complexity of Positive First-Order Logic without Equali..:

Madelaine, Florent ; Martin, Barnaby
ACM Transactions on Computational Logic (TOCL). 13 (2012) 1 - p. 1-17 , 2012

Link: https://dl.acm.org/doi/1..

10

The Complexity of Positive First-Order Logic without Equali..:

Madelaine, Florent ; Martin, Barnaby
ACM Transactions on Computational Logic. 13 (2012) 1 - p. 1-17 , 2012

Link: https://doi.org/10.1145/..

11

Constraint Satisfaction, Logic and Forbidden Patterns:

Madelaine, Florent ; Stewart, Iain A.
SIAM Journal on Computing. 37 (2007) 1 - p. 132-163 , 2007

Link: https://doi.org/10.1137/..

12

Dichotomies for classes of homomorphism problems involving ..:

Feder, Tomás ; Madelaine, Florent ; Stewart, Iain A.
Theoretical Computer Science. 314 (2004) 1-2 - p. 1-43 , 2004

Link: https://doi.org/10.1016/..

13

On Guarded Extensions of MMSNP:

, In: Lecture Notes in Computer Science; Unity of Logic and Computation,

Barsukov, Alexey ; Madelaine, Florent R. - p. 202-213 , 2023

Link: https://doi.org/10.1007/..

14

On the Complexity of the Model Checking Problem:

Madelaine, Florent R. ; Martin, Barnaby D.
SIAM Journal on Computing. 47 (2018) 3 - p. 769-797 , 2018

Link: https://doi.org/10.1137/..

15

Improved upper and lower bounds on the feedback vertex numb..:

Madelaine, Florent R. ; Stewart, Iain A.
Discrete Mathematics. 308 (2008) 18 - p. 4144-4164 , 2008

Link: https://doi.org/10.1016/..