2693 search results - page 395 / 539 » On Computing Complex Navigation Functions |
162
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
193
click to vote
JMLR
2008
15 years 6 months ago
2008
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
179
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
173
click to vote
CASES
2003
ACM
15 years 11 months ago
2003
ACM
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
159
click to vote
CJTCS
1999
15 years 6 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...