17541 search results - page 103 / 3509 » Complexity in scalable computing |
FOCS
1990
IEEE
15 years 4 months ago
1990
IEEE
COLING
1996
15 years 1 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
179
click to vote
APAL
2011
14 years 7 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
DEXA
2004
Springer
15 years 5 months ago
2004
Springer
Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definit...
ANTS
1994
Springer
15 years 4 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...