Követés
Ross Willard
Ross Willard
Pure Mathematics, University of Waterloo
E-mail megerősítve itt: uwaterloo.ca
Cím
Hivatkozott rá
Hivatkozott rá
Év
Tractability and learnability arising from algebras with few subpowers
P Idziak, P Marković, R McKenzie, M Valeriote, R Willard
SIAM Journal on Computing 39 (7), 3023-3037, 2010
1882010
Varieties with few subalgebras of powers
J Berman, P Idziak, P Marković, R McKenzie, M Valeriote, R Willard
Transactions of the American Mathematical Society 362 (3), 1445-1473, 2010
1412010
Polymorphisms, and how to use them
L Barto, A Krokhin, R Willard
Dagstuhl Follow-Ups 7, 2017
1242017
Finitely many primitive positive clones
S Burris, R Willard
Proceedings of the American Mathematical Society 101 (3), 427-430, 1987
791987
Essential arities of term operations in finite algebras
R Willard
Discrete Mathematics 149 (1-3), 239-259, 1996
751996
Characterizations of several Maltsev conditions
M Kozik, A Krokhin, M Valeriote, R Willard
Algebra universalis 73 (3), 205-224, 2015
722015
A finite basis theorem for residually finite, congruence meet-semidistributive varieties
R Willard
The Journal of Symbolic Logic 65 (1), 187-200, 2000
592000
Testing expressibility is hard
R Willard
International Conference on Principles and Practice of Constraint …, 2010
422010
Residually finite, congruence meet-semidistributive varieties of finite type have a finite residual bound
K Kearnes, R Willard
Proceedings of the American Mathematical Society 127 (10), 2841-2850, 1999
361999
Natural dualities for quasivarieties generated by a finite commutative ring
DM Clark, PM Idziak, LR Sabourin, C Szabó, R Willard
Algebra Universalis 46 (1), 285-320, 2001
352001
The dualisability of a quasi-variety is independent of the generating algebra
BA Davey, R Willard
Algebra Universalis 45 (1), 103-106, 2001
352001
Near unanimity constraints have bounded pathwidth duality
L Barto, M Kozik, R Willard
2012 27th Annual IEEE Symposium on Logic in Computer Science, 125-134, 2012
332012
Full duality among graph algebras and flat graph algebras
WA Lampe, GF McNulty, R Willard
Algebra Universalis 45 (2), 311-334, 2001
292001
New tools for proving dualizability
R Willard
Dualities, interpretability and ordered structures, 69-74, 1999
271999
Full does not imply strong, does it?
BA Davey, M Haviar, R Willard
Algebra Universalis 54 (1), 1-22, 2005
262005
An algebra that is dualizable but not fully dualizable
J Hyndman, R Willard
Journal of Pure and Applied Algebra 151 (1), 31-42, 2000
252000
Tarski’s finite basis problem via 𝐀 (𝒯)
R Willard
Transactions of the American Mathematical Society 349 (7), 2755-2774, 1997
221997
Structural entailment
BA Davey, M Haviar, R Willard
Algebra Universalis 54 (4), 397-416, 2005
212005
Varieties having Boolean factor congruences
R Willard
Journal of Algebra 132 (1), 130-153, 1990
201990
Equational complexity of the finite algebra membership problem
GF McNulty, Z Székely, R Willard
International Journal of Algebra and Computation 18 (08), 1283-1319, 2008
192008
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20