Sciweavers

28888 search results - page 130 / 5778
» Computability and complexity in analysis
Sort
View
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
14 years 18 days ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel
ICALP
2001
Springer
14 years 17 days ago
The Complexity of Computing the Size of an Interval
Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
LICS
2000
IEEE
14 years 14 days ago
Computational Complexity of Some Problems Involving Congruences on Algebras
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...
Clifford Bergman, Giora Slutzki