42230 search results - page 41 / 8446 » Algorithms and Complexity Results for |
ANTS
2004
Springer
14 years 1 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
DFG
1992
Springer
14 years 17 days ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
LCC
1994
14 years 17 days ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
AAAI
2004
13 years 10 months ago
2004
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition alg...
AAECC
2002
Springer
13 years 8 months ago
2002
Springer
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...