13 search results - page 1 / 3 » Complexity of Some Problems Concerning Varieties and Quasi-V... |
SIAMCOMP
2000
13 years 9 months 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 ...
LICS
2000
IEEE
14 years 1 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...
JC
2007
13 years 9 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
ICECCS
1995
IEEE
14 years 28 days ago
1995
IEEE
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...