Libor Barto

From MaRDI portal
Person:494632

Available identifiers

zbMath Open barto.liborDBLP68/3678WikidataQ102406949 ScholiaQ102406949MaRDI QIDQ494632

List of research outcomes





PublicationDate of PublicationType
Promises make finite (constraint satisfaction) problems infinitary2024-12-19Paper
Finite algebras with Hom-sets of polynomial size2024-12-17Paper
Multisorted Boolean clones determined by binary relations up to minion homomorphisms2024-11-20Paper
Combinatorial gap theorem and reductions between promise CSPs2024-07-19Paper
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras2024-07-03Paper
https://portal.mardi4nfdi.de/entity/Q61684212023-08-08Paper
Finite Algebras with Hom-Sets of Polynomial Size2023-07-13Paper
Symmetries of structures that fail to interpret something finite2023-02-23Paper
Algebraic Approach to Promise Constraint Satisfaction2022-12-08Paper
Fixed-Template Promise Model Checking Problems2022-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49935942021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q49935952021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51446752021-01-19Paper
Constraint Satisfaction Problems over Finite Structures2020-10-10Paper
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case2020-10-09Paper
Sensitive instances of the Constraint Satisfaction Problem2020-05-01Paper
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)2020-04-01Paper
Accessible set functors are universal2020-03-06Paper
Algebraic theory of promise constraint satisfaction problems, first steps2020-01-30Paper
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures2019-11-29Paper
Accessible set endofunctors are universal2019-09-11Paper
The minimal arity of near unanimity polymorphisms2019-08-12Paper
Finitely related algebras in congruence modular varieties have few subpowers2018-06-21Paper
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems2018-04-23Paper
The wonderland of reflections2018-04-06Paper
Deciding absorption in relational structures2017-10-09Paper
Near Unanimity Constraints Have Bounded Pathwidth Duality2017-05-16Paper
The collapse of the bounded width hierarchy2016-10-07Paper
Deciding absorption2016-09-23Paper
Robustly solvable constraint satisfaction problems2016-09-02Paper
The constraint satisfaction problem and universal algebra2016-03-21Paper
Mal'tsev conditions, lack of absorption, and solvability.2015-09-01Paper
Constraint Satisfaction Problems Solvable by Local Consistency Methods2014-09-12Paper
Constraint Satisfaction Problems of Bounded Width2014-07-25Paper
Robust satisfiability of constraint satisfaction problems2014-05-13Paper
Polymorphisms of small digraphs2013-10-18Paper
CSP dichotomy for special polyads2013-10-09Paper
Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms2013-02-04Paper
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem2012-04-03Paper
Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited2011-01-07Paper
Congruence distributivity implies bounded width2010-09-06Paper
Congruence modularity implies cyclic terms for finite algebras2010-01-04Paper
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)2009-11-06Paper
CSP dichotomy for special triads2009-09-11Paper
Slices of essentially algebraic categories2009-06-22Paper
https://portal.mardi4nfdi.de/entity/Q53021042009-01-05Paper
Finitary set endofunctors are alg-universal2007-09-03Paper
The category of varieties and interpretations is alg-universal2007-09-03Paper
Weakly terminal objects in quasicategories of \(\mathcal{SET}\) endofunctors2006-02-23Paper
https://portal.mardi4nfdi.de/entity/Q57010102005-11-02Paper

Research outcomes over time

This page was built for person: Libor Barto