28888 search results - page 117 / 5778 » Computability and complexity in analysis |
COCOON
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
ECBS
1996
IEEE
14 years 7 days ago
1996
IEEE
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
STOC
2000
ACM
13 years 11 months 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...
FCT
2007
Springer
14 years 2 months ago
2007
Springer
