Image de couverture de livre

On the complexity of solving equations over the symmetric group $S_4$

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aichinger, Erhard, Grünbacher, Simon
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity Rings and Algebras 08A40, 68Q25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Polynomial interpolation of partial functions in finite algebras with a Mal'cev term
par: Aichinger, Erhard, et autres
Publié: (2026)

Polynomial-Time Algorithms for Black-Box Distributive Expanded Groups
par: Anokhin, Mikhail
Publié: (2025)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
par: Marković, Petar, et autres
Publié: (2026)

Clonoids over vector spaces
par: Fioravanti, Stefano, et autres
Publié: (2026)

Polynomial definability in constraint languages with few subpowers
par: Bulín, Jakub, et autres
Publié: (2023)

The Complexity of Resilience for Digraph Queries
par: Bodirsky, Manuel, et autres
Publié: (2026)

Zero testing and equation solving for sparse polynomials on rectangular domains
par: Aichinger, Erhard, et autres
Publié: (2023)

On when the union of two algebraic sets is algebraic
par: Aichinger, Erhard, et autres
Publié: (2023)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
par: Bodirsky, Manuel, et autres
Publié: (2024)

Polynomial-time isomorphism test for groups with abelian Sylow subgroups
par: Skresanov, Saveliy V.
Publié: (2026)

Polynomial-time isomorphism test for $k$-generated extensions of abelian groups
par: Skresanov, Saveliy V.
Publié: (2026)

Compression with wildcards: All models of a Boolean 2-CNF
par: Wild, Marcel
Publié: (2012)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
par: MIT Hardness Group, et autres
Publié: (2024)

Conservative Maltsev Constraint Satisfaction Problems
par: Bodirsky, Manuel, et autres
Publié: (2025)

Parallel Algorithms for Group Isomorphism via Code Equivalence
par: Levet, Michael
Publié: (2026)

Ivo G. Rosenberg's Work on Maximal Clones and Minimal Clones
par: Szendrei, Agnes
Publié: (2024)

Barriers for rectangular matrix multiplication
par: Christandl, Matthias, et autres
Publié: (2020)

Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity
par: Ham, Lucy, et autres
Publié: (2022)

Linear average-case complexity of algorithmic problems in groups
par: Olshanskii, Alexander, et autres
Publié: (2022)

On the Low Weight Polynomial Multiple Problem
par: Ţiplea, Ferucio Laurenţiu, et autres
Publié: (2024)

There Are No Post-Quantum Weakly Pseudo-Free Families in Any Nontrivial Variety of Expanded Groups
par: Anokhin, Mikhail
Publié: (2023)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
par: Xia, Mingji
Publié: (2026)

On polynomial completeness properties of finite Mal'cev algebras
par: Rossi, Bernardo
Publié: (2023)

Clonoids between modules
par: Mayr, Peter, et autres
Publié: (2023)

The Word Problem for Products of Symmetric Groups
par: Simon, Hans U.
Publié: (2025)

On the computation of tensor functions under tensor-tensor multiplications with linear maps
par: Ju, Jeong-Hoon, et autres
Publié: (2025)

Cluster Vertex Deletion Problems on Cubic Graphs
par: Rusu, Irena
Publié: (2025)

On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
par: Avila, Tatiana Rocha, et autres
Publié: (2026)

Computing bases in Hermite normal form of lattices of integer relations
par: Labahn, George, et autres
Publié: (2026)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy
par: Schaefer, Marcus, et autres
Publié: (2025)

No Constant-Cost Protocol for Point--Line Incidence
par: Göös, Mika, et autres
Publié: (2026)

Undefinability of Approximation of 2-to-2 Games
par: Dawar, Anuj, et autres
Publié: (2025)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Complexity Classification Transfer for CSPs via Algebraic Products
par: Bodirsky, Manuel, et autres
Publié: (2022)

Computational Complexity of Finding Subgroups of a Given Order
par: Lakshmanan, K.
Publié: (2025)

Symmetric subrank and its border analogue
par: Biaggi, Benjamin, et autres
Publié: (2026)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
par: Bodirsky, Manuel, et autres
Publié: (2023)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
par: Alpay, Faruk, et autres
Publié: (2026)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
par: Abdullah, Duaa, et autres
Publié: (2025)

Recognition of Seifert fibered spaces with boundary is in NP
par: Jackson, Adele
Publié: (2023)