19320 search results - page 116 / 3864 » On the complexity of computing determinants |
97
Voted
CHI
2004
ACM
15 years 10 months ago
2004
ACM
140
Voted
COLING
1996
15 years 5 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...
230
click to vote
APAL
2011
14 years 11 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...
133
click to vote
ANTS
1994
Springer
15 years 8 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...