2430 search results - page 107 / 486 » Computing Tutte Polynomials |
109
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Systems biologists are often faced with competing models for a given experimental system. Unfortunately, performing experiments can be time-consuming and expensive. Therefore, ...
155
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
154
Voted
FSTTCS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
134
click to vote
STOC
1997
ACM
15 years 9 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
232
click to vote
Publication
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...