Computational complexity of some problems involving congruences on algebras (original) (raw)
Related papers
The complexity of the Chinese Remainder Theorem
arXiv (Cornell University), 2023
Complexity of certain decision problems about congruential languages
Journal of Computer and System Sciences, 1985
The Chinese Remainder Theorem, Associative Algebras, and Multiplicative Complexity
1990 Conference Record Twenty-Fourth Asilomar Conference on Signals, Systems and Computers, 1990.
EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
International Journal of Algebra and Computation, 2008
The Algorithmic Complexity of Modular Decomposition
Social Science Research Network, 2001
Efficient Algorithms for Finite mathbbZ\mathbb{Z}mathbbZ-Algebras
Groups, complexity, cryptology, 2024
The lattice of congruence lattices of algebras on a finite set
Algebra universalis
Some Complexity Results for Polynomial Ideals
Journal of Complexity, 1997
Computational Recognition of Properties of Finite Algebras
2008
Quotient complexity of ideal languages
Theoretical Computer Science, 2013
On the intrinsic complexity of the arithmetic Nullstellensatz
Journal of Pure and Applied Algebra, 2000
Weak Congruences of Algebras with CONSTANTS1
On the Complexity of Generalized Discrete Logarithm Problem
arXiv (Cornell University), 2022
The membership problem for unmixed polynomial ideals is solvable in single exponential time
1991
Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties
Algebra Universalis, 1988
Definable principal congruences and solvability
Annals of Pure and Applied Logic, 2009
Definability of principal congruences in equivalential algebras
Colloquium Mathematicum
Algorithms for Commutative Algebras Over the Rational Numbers
Foundations of Computational Mathematics, 2016
The Complexity of Modular Graph Automorphism
SIAM Journal on Computing, 2000
Algorithms for arithmetic groups with the congruence subgroup property
Journal of Algebra, 2015
Abstracts from the 20th Conference on Applications of Computer Algebra, ACA 2014
2014
On the reduction in multiplicative complexity achieved by the polynomial residue number system
IEEE Transactions on Signal Processing, 1992
Fast congruence closure and extensions
Information and Computation, 2007
A Characterization of Finitely Decidable Congruence Modular Varieties
1993
Fully invariant and verbal congruence relations
Algebra universalis, 2013
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
Clifford Bergman, Giora Slutzki
SIAM Journal on Computing, 2000
On Randomized Algebraic Test Complexity
1992
ArXiv, 2016
Complexity of computation in finite fields
Journal of Mathematical Sciences, 2013
On congruence lattices of finite partial unary algebras
Complexity of the identity checking problem for finite semigroups
Journal of Mathematical Sciences, 2009
Computational Recognition of Properities of Finite Algebras
2003
Congruence Preservation, Lattices and Recognizability
Cornell University - arXiv, 2020
On the Finitary Characterization of-Congruences
1997