Matthew Valeriote

Orcid: 0000-0001-6568-7526

Affiliations:
  • McMaster University, Department of Mathematics and Statistics, Hamilton, Canada


According to our database1, Matthew Valeriote authored at least 25 papers between 1989 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Deciding some Maltsev conditions in finite Idempotent Algebras.
J. Symb. Log., 2020

Sensitive Instances of the Constraint Satisfaction Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Constant-Query Testability of Assignments to Constraint Satisfaction Problems.
SIAM J. Comput., 2019

Testing for a Semilattice Term.
Order, 2019

Learnability of Solutions to Conjunctive Queries.
J. Mach. Learn. Res., 2019

Polynomial-time tests for difference terms in idempotent varieties.
Int. J. Algebra Comput., 2019

Deciding the existence of minority terms.
CoRR, 2019

2016
Testing Assignments to Constraint Satisfaction Problems.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Algebras and Algorithms.
Proceedings of the 2015 IEEE International Symposium on Multiple-Valued Logic, 2015

Learnability of Solutions to Conjunctive Queries: The Full Dichotomy.
Proceedings of The 28th Conference on Learning Theory, 2015

2013
Generic expression hardness results for primitive positive formula comparison.
Inf. Comput., 2013

2012
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
Theory Comput. Syst., 2012

2010
Tractability and Learnability Arising from Algebras with Few Subpowers.
SIAM J. Comput., 2010

2009
Omitting Types, Bounded Width and the Ability to Count.
Int. J. Algebra Comput., 2009

On the Complexity of Some Maltsev Conditions.
Int. J. Algebra Comput., 2009

Definable principal congruences and solvability.
Ann. Pure Appl. Log., 2009

2008
Recent Results on the Algebraic Approach to the CSP.
Proceedings of the Complexity of Constraints, 2008

2007
On tractability and congruence distributivity.
Log. Methods Comput. Sci., 2007

1999
A Geometric Consequence of Residual Smallness.
Ann. Pure Appl. Log., 1999

1996
A Residually Small, Finitely Generated, Semi-Simple Variety which is not Residually Finite.
Int. J. Algebra Comput., 1996

1994
On Solvable Congruences in Finitely Decidable Varieties.
Math. Log. Q., 1994

1992
Some Properties of Finitely Decidable Varieties.
Int. J. Algebra Comput., 1992

1991
A Structure Theorem for Strongly Abelian Varieties with Few Models.
J. Symb. Log., 1991

Decidable Discriminator Varieties from Unary Varieties.
J. Symb. Log., 1991

1989
Structure of decidable locally finite varieties.
Progress in mathematics 79, Birkhäuser, ISBN: 978-3-7643-3439-0, 1989


  Loading...