199 search results - page 1 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
92
Voted
IJAC
2007
15 years 1 months ago
2007
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...
99
Voted
IJAC
2002
15 years 26 days ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
120
Voted
SIAMCOMP
2000
15 years 26 days ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
151
Voted
LICS
2000
IEEE
15 years 5 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
114
Voted
DCC
2008
IEEE
16 years 21 days ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...