29908 search results - page 72 / 5982 » On the Complexity of |
126
Voted
SIAMREV
2010
14 years 11 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...
156
click to vote
RECOMB
2005
Springer
16 years 4 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...
167
click to vote
COCO
2009
Springer
15 years 11 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...
112
click to vote
COCO
2003
Springer
15 years 9 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...
181
click to vote
PODS
1994
ACM
15 years 8 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 {...