default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Valeriote
Person information
- affiliation: McMaster University, Department of Mathematics and Statistics, Hamilton, Canada
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j18]Alexandr Kazda
, Matt Valeriote:
Deciding some Maltsev conditions in finite Idempotent Algebras. J. Symb. Log. 85(2): 539-562 (2020)- [c8]Libor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote:
Sensitive Instances of the Constraint Satisfaction Problem. ICALP 2020: 110:1-110:18 - [i8]Libor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote:
Sensitive instances of the Constraint Satisfaction Problem. CoRR abs/2005.00266 (2020) - [i7]William J. DeMeo, Ralph Freese, Matthew Valeriote:
Polynomial-time Tests for Difference Terms in Idempotent Varieties. CoRR abs/2011.07879 (2020)
2010 – 2019
- 2019
- [j17]William J. DeMeo, Ralph Freese, Matthew Valeriote:
Polynomial-time tests for difference terms in idempotent varieties. Int. J. Algebra Comput. 29(6): 927-949 (2019) - [j16]Hubie Chen, Matthew Valeriote:
Learnability of Solutions to Conjunctive Queries. J. Mach. Learn. Res. 20: 67:1-67:28 (2019) - [j15]Ralph Freese, James B. Nation, Matt Valeriote:
Testing for a Semilattice Term. Order 36(1): 65-76 (2019) - [j14]Hubie Chen, Matt Valeriote, Yuichi Yoshida:
Constant-Query Testability of Assignments to Constraint Satisfaction Problems. SIAM J. Comput. 48(3): 1022-1045 (2019) - [i6]Alexandr Kazda, Jakub Oprsal, Matt Valeriote, Dmitriy Zhuk:
Deciding the existence of minority terms. CoRR abs/1901.00316 (2019) - 2017
- [i5]Alexandr Kazda, Matt Valeriote:
Deciding some Maltsev conditions in finite idempotent algebras. CoRR abs/1704.05928 (2017) - 2016
- [c7]Hubie Chen, Matthew Valeriote, Yuichi Yoshida:
Testing Assignments to Constraint Satisfaction Problems. FOCS 2016: 525-534 - [i4]Hubie Chen, Matthew Valeriote, Yuichi Yoshida:
Testing Assignments to Constraint Satisfaction Problems. CoRR abs/1608.03017 (2016) - 2015
- [c6]Hubie Chen, Matthew Valeriote:
Learnability of Solutions to Conjunctive Queries: The Full Dichotomy. COLT 2015: 326-337 - [c5]Matthew Valeriote:
Algebras and Algorithms. ISMVL 2015: 1 - 2013
- [j13]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic expression hardness results for primitive positive formula comparison. Inf. Comput. 222: 108-120 (2013) - 2012
- [j12]Simone Bova, Hubie Chen, Matthew Valeriote:
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Theory Comput. Syst. 50(2): 329-353 (2012) - [i3]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic Expression Hardness Results for Primitive Positive Formula Comparison. CoRR abs/1205.5745 (2012) - 2011
- [c4]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic Expression Hardness Results for Primitive Positive Formula Comparison. ICALP (2) 2011: 344-355 - 2010
- [j11]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and Learnability Arising from Algebras with Few Subpowers. SIAM J. Comput. 39(7): 3023-3037 (2010)
2000 – 2009
- 2009
- [j10]Pawel M. Idziak, Keith A. Kearnes, Emil W. Kiss, Matthew Valeriote:
Definable principal congruences and solvability. Ann. Pure Appl. Log. 157(1): 30-49 (2009) - [j9]Ralph Freese, Matthew Valeriote:
On the Complexity of Some Maltsev Conditions. Int. J. Algebra Comput. 19(1): 41-77 (2009) - [j8]Benoît Larose, Matthew Valeriote, László Zádori:
Omitting Types, Bounded Width and the Ability to Count. Int. J. Algebra Comput. 19(5): 647-668 (2009) - [i2]Matthew Valeriote, Simone Bova, Hubie Chen:
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - 2008
- [c3]Andrei A. Bulatov, Matthew Valeriote:
Recent Results on the Algebraic Approach to the CSP. Complexity of Constraints 2008: 68-92 - 2007
- [j7]Emil W. Kiss, Matthew Valeriote:
On tractability and congruence distributivity. Log. Methods Comput. Sci. 3(2) (2007) - [c2]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and learnability arising from algebras with few subpowers. LICS 2007: 213-224 - [i1]Emil W. Kiss, Matthew Valeriote:
On tractability and congruence distributivity. CoRR abs/0705.2229 (2007) - 2006
- [c1]Emil W. Kiss, Matthew Valeriote:
On Tractability and Congruence Distributivity. LICS 2006: 221-230
1990 – 1999
- 1999
- [j6]Keith A. Kearnes, Emil W. Kiss, Matthew Valeriote:
A Geometric Consequence of Residual Smallness. Ann. Pure Appl. Log. 99(1-3): 137-169 (1999) - 1996
- [j5]Matthew Valeriote:
A Residually Small, Finitely Generated, Semi-Simple Variety which is not Residually Finite. Int. J. Algebra Comput. 6(5): 563-570 (1996) - 1994
- [j4]Matthew Valeriote:
On Solvable Congruences in Finitely Decidable Varieties. Math. Log. Q. 40: 398-414 (1994) - 1992
- [j3]Matthew Valeriote, Ross Willard:
Some Properties of Finitely Decidable Varieties. Int. J. Algebra Comput. 2(1): 89-102 (1992) - 1991
- [j2]Bradd Hart, Matthew Valeriote:
A Structure Theorem for Strongly Abelian Varieties with Few Models. J. Symb. Log. 56(3): 832-852 (1991) - [j1]Stanley Burris, Ralph McKenzie, Matthew Valeriote:
Decidable Discriminator Varieties from Unary Varieties. J. Symb. Log. 56(4): 1355-1368 (1991)
1980 – 1989
- 1989
- [b1]Ralph McKenzie, Matthew Valeriote:
Structure of decidable locally finite varieties. Progress in mathematics 79, Birkhäuser 1989, ISBN 978-3-7643-3439-0, pp. I-VIII, 1-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
