13603 search results - page 16 / 2721 » On the Computational Complexity of Cut-Reduction |
STOC
2000
ACM
14 years 7 hour ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
BMCBI
2006
13 years 8 months ago
2006
Background: Microarray expression profiling has been widely used to identify differentially expressed genes in complex cellular systems. However, while such methods can be used to...
FOCS
1990
IEEE
14 years 15 days ago
1990
IEEE
COLING
1996
13 years 9 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...
APAL
2011
13 years 3 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...