Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

IJAC
2007

favoriteEmaildiscussreport

73views more IJAC 2007»

Computationally and Algebraically Complex Finite Algebra Membership Problems

13 years 4 months ago

Computationally and Algebraically Complex Finite Algebra Membership Problems

Download www.tcs.uj.edu.pl

In this paper we produce a ﬁnite algebra which generates a variety with a PSPACE-complete membership problem. We produce another ﬁnite algebra with a γ function that grows exponentially. The results are obtained via a modiﬁcation of a construction of the algebra A(T) that was introduced by Ralph McKenzie in 1996.

Marcin Kozik

Real-time Traffic

IJAC 2007 | PSPACE-complete Membership Problem | Ralph McKenzie | ﬁnite Algebra |

claim paper

Related Content

» Computational Complexity of Generators and Nongenerators in Algebra

» Complexity of Some Problems Concerning Varieties and QuasiVarieties of Algebras

» Computational Complexity of Some Problems Involving Congruences on Algebras

» On solving sparse algebraic equations over finite fields

» FFPACK finite field linear algebra package

» Automatic Generation of Classification Theorems for Finite Algebras

» On the Scope of the UniversalAlgebraic Approach to Constraint Satisfaction

» A Note on the Complexity of Real Algebraic Hypersurfaces

» Detecting Rational Points on Hypersurfaces over Finite Fields

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	IJAC
Authors	Marcin Kozik

Comments (0)