Benoit Larose
Benoit Larose
Lacim, UQAM
確認したメール アドレス: lacim.ca - ホームページ
タイトル
引用先
引用先
Stable sets of maximal size in Kneser-type graphs
B Larose, C Malvenuto
European Journal of Combinatorics 25 (5), 657-673, 2004
1112004
Bounded width problems and algebras
B Larose, L Zádori
Algebra universalis 56 (3), 439-466, 2007
1082007
A characterisation of first-order constraint satisfaction problems
B Larose, C Loten, C Tardif
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 201-210, 2006
952006
Dualities for constraint satisfaction problems
AA Bulatov, A Krokhin, B Larose
Complexity of Constraints, 93-124, 2008
742008
Universal algebra and hardness results for constraint satisfaction problems
B Larose, P Tesson
Theoretical Computer Science 410 (18), 1629-1647, 2009
702009
Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras
B Larose, L Zádori
International Journal of Algebra and Computation 16 (03), 563-581, 2006
492006
Projectivity and independent sets in powers of graphs
B Larose, C Tardif
Journal of Graph Theory 40 (3), 162-171, 2002
402002
Strongly rigid graphs and projectivity
B Larose, C Tardif
Multiple-Valued Logic 7, 339-361, 2001
402001
Symmetric Datalog and constraint satisfaction problems in Logspace
L Egri, B Larose, P Tesson
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 193-202, 2007
382007
The complexity of the extendibility problem for finite posets
B Larose, L Zádori
SIAM Journal on Discrete Mathematics 17 (1), 114-121, 2003
382003
Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction
A Krokhin, B Larose
SIAM Journal on Discrete Mathematics 22 (1), 312-328, 2008
372008
Algebraic properties and dismantlability of finite posets
B Larose, L Zádori
Discrete Mathematics 163 (1-3), 89-99, 1997
351997
On normal Cayley graphs and hom-idempotent graphs
B Larose, F Laviolette, C Tardif
European Journal of Combinatorics 19 (7), 867-881, 1998
321998
Taylor operations on finite reflexive structures
B Larose
International Journal of Mathematics and Computer Science 1 (1), 1-26, 2006
302006
The complexity of the list homomorphism problem for graphs
L Egri, A Krokhin, B Larose, P Tesson
Theory of Computing Systems 51 (2), 143-178, 2012
292012
Asking the metaquestions in constraint tractability
H Chen, B Larose
ACM Transactions on Computation Theory (TOCT) 9 (3), 1-27, 2017
272017
A polynomial-time algorithm for near-unanimity graphs
B Larose, C Loten, L Zádori
Journal of Algorithms 55 (2), 177-191, 2005
242005
Omitting types, bounded width and the ability to count
B Larose, M Valeriote, L Zádori
International Journal of Algebra and Computation 19 (05), 647-668, 2009
232009
Maltsev+ Datalog--≫ Symmetric Datalog
V Dalmau, B Larose
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 297-306, 2008
232008
Finite posets and topological spaces in locally finite varieties
B Larose, L Zádori
Algebra Universalis 52 (2), 119-136, 2005
232005
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20