13603 search results - page 27 / 2721 » On the computational complexity of bridgecard |
191
click to vote
COLING
1996
15 years 8 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...
276
click to vote
APAL
2011
15 years 1 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...
174
click to vote
DEXA
2004
Springer
16 years 7 days 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...