29908 search results - page 72 / 5982 » On the Complexity of |
SIAMREV
2010
13 years 4 months ago
2010
The Lorenz attractor is one of the best known examples of applied mathematics. However, much of what is known about it is a result of numerical calculations and not of mathematica...
RECOMB
2005
Springer
14 years 10 months ago
2005
Springer
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
COCO
2009
Springer
14 years 4 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
COCO
2003
Springer
14 years 3 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
PODS
1994
ACM
14 years 2 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...