Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2212.02653 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Flexible constraint satisfiability and a problem in semigroup theory
by: Jackson, Marcel
Published: (2015)
by: Jackson, Marcel
Published: (2015)
SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
by: Marković, Petar, et al.
Published: (2026)
by: Marković, Petar, et al.
Published: (2026)
The equational theory of the Weihrauch lattice with multiplication
by: Neumann, Eike, et al.
Published: (2024)
by: Neumann, Eike, et al.
Published: (2024)
The colored edge theory of A. Bulatov and binary absorption in minimal Taylor algebras
by: Brady, Zarathustra, et al.
Published: (2026)
by: Brady, Zarathustra, et al.
Published: (2026)
Algebra of Self-Replication
by: Moss, Lawrence S.
Published: (2023)
by: Moss, Lawrence S.
Published: (2023)
Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)
by: Galatos, Nikolaos, et al.
Published: (2025)
The Complexity of Resilience for Digraph Queries
by: Bodirsky, Manuel, et al.
Published: (2026)
by: Bodirsky, Manuel, et al.
Published: (2026)
Probabilistic equational spectrum, primality and approximation in finite algebras
by: Cardó, Carles
Published: (2026)
by: Cardó, Carles
Published: (2026)
Polynomial definability in constraint languages with few subpowers
by: Bulín, Jakub, et al.
Published: (2023)
by: Bulín, Jakub, et al.
Published: (2023)
The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
Ivo G. Rosenberg's Work on Maximal Clones and Minimal Clones
by: Szendrei, Agnes
Published: (2024)
by: Szendrei, Agnes
Published: (2024)
Graded Monads in the Semantics of Nominal Automata
by: Schulze, Hannes, et al.
Published: (2025)
by: Schulze, Hannes, et al.
Published: (2025)
A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
by: Bodirsky, Manuel, et al.
Published: (2024)
by: Bodirsky, Manuel, et al.
Published: (2024)
Preservation theorems on sparse classes revisited
by: Dawar, Anuj, et al.
Published: (2024)
by: Dawar, Anuj, et al.
Published: (2024)
Computational Complexity of Model-Checking Quantum Pushdown Systems
by: Lin, Deren, et al.
Published: (2025)
by: Lin, Deren, et al.
Published: (2025)
Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)
by: Tang, Jian-Gang
Published: (2022)
Complexity Classification Transfer for CSPs via Algebraic Products
by: Bodirsky, Manuel, et al.
Published: (2022)
by: Bodirsky, Manuel, et al.
Published: (2022)
From Gödel incompleteness to the consistency of circuit lower bounds
by: Atserias, Albert, et al.
Published: (2026)
by: Atserias, Albert, et al.
Published: (2026)
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
by: Grochow, Joshua A., et al.
Published: (2021)
by: Grochow, Joshua A., et al.
Published: (2021)
Count-Free Weisfeiler--Leman and Group Isomorphism
by: Collins, Nathaniel A., et al.
Published: (2022)
by: Collins, Nathaniel A., et al.
Published: (2022)
Polymorphism-homogeneity and universal algebraic geometry
by: Tóth, Endre, et al.
Published: (2020)
by: Tóth, Endre, et al.
Published: (2020)
Undefinability of Approximation of 2-to-2 Games
by: Dawar, Anuj, et al.
Published: (2025)
by: Dawar, Anuj, et al.
Published: (2025)
Complexity of chess domination problems
by: Langlois-Rémillard, Alexis, et al.
Published: (2022)
by: Langlois-Rémillard, Alexis, et al.
Published: (2022)
There is a deep 1-generic set
by: Li, Ang
Published: (2024)
by: Li, Ang
Published: (2024)
The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026)
by: Camerlo, Riccardo, et al.
Published: (2026)
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)
by: Bannach, Max, et al.
Published: (2025)
A Minimal Substitution Basis for the Kalmár Elementary Functions
by: Prunescu, Mihai, et al.
Published: (2025)
by: Prunescu, Mihai, et al.
Published: (2025)
Finitely (In)tractable Promise Constraint Satisfaction Problems
by: Asimi, Kristina, et al.
Published: (2020)
by: Asimi, Kristina, et al.
Published: (2020)
Unifying lower bounds for algebraic machines, semantically
by: Seiller, Thomas, et al.
Published: (2018)
by: Seiller, Thomas, et al.
Published: (2018)
How Hard is it to be a Star? Convex Geometry and the Real Hierarchy
by: Schaefer, Marcus, et al.
Published: (2025)
by: Schaefer, Marcus, et al.
Published: (2025)
The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
by: Kátay, Tamás, et al.
Published: (2023)
by: Kátay, Tamás, et al.
Published: (2023)
The Complexity of Resilience Problems via Valued Constraint Satisfaction
by: Bodirsky, Manuel, et al.
Published: (2023)
by: Bodirsky, Manuel, et al.
Published: (2023)
On the complexity of solving equations over the symmetric group $S_4$
by: Aichinger, Erhard, et al.
Published: (2025)
by: Aichinger, Erhard, et al.
Published: (2025)
Some derivations among Logarithmic Space Bounded Counting Classes
by: Janaki, V., et al.
Published: (2023)
by: Janaki, V., et al.
Published: (2023)
On Halting vs Converging in Recurrent Graph Neural Networks
by: Bollen, Jeroen, et al.
Published: (2026)
by: Bollen, Jeroen, et al.
Published: (2026)
Computational Complexity of Finding Subgroups of a Given Order
by: Lakshmanan, K.
Published: (2025)
by: Lakshmanan, K.
Published: (2025)
Logical reduction of relations: from relational databases to Peirce's reduction thesis
by: Koshkin, Sergiy
Published: (2024)
by: Koshkin, Sergiy
Published: (2024)
Refutability as Recursive as Provability
by: Cattabriga, Paola
Published: (2024)
by: Cattabriga, Paola
Published: (2024)
On some algebraic properties of Plonka sums and regularized varieties
by: Bonzio, S., et al.
Published: (2026)
by: Bonzio, S., et al.
Published: (2026)
Recognition of Seifert fibered spaces with boundary is in NP
by: Jackson, Adele
Published: (2023)
by: Jackson, Adele
Published: (2023)