𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The bounded complexity function versus the unbounded complexity function

✍ Scribed by Sheng Qian; Wenxiang Sun; Cheng Zhang

Book ID
113721597
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
234 KB
Volume
387
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The parallel complexity of function appr
The parallel complexity of function approximation
✍ JΓΆrg-Detlef Kern πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 679 KB

We introduce a parallel model of computation over the reals. We then obtain lower and upper bounds on the parallel complexity of approximating certain types of smooth functions in n dimensions. The bounds are obtained for both unbounded and bounded parallelism. o IW Academic PRSS, IIIC.

Bounding the Complexity of Advice Functi
Bounding the Complexity of Advice Functions
✍ R. Gavalda πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 624 KB

It was known that every set \(\boldsymbol{A}\) in \(P\) poly has an advice function in \(\operatorname{PF}\left(\Sigma_{2}^{p}(A)\right)\). This paper shows that \(A\) also has an advice function in \(\operatorname{PF}\left(\operatorname{NP}(A) \oplus \Sigma_{3}^{p}\right)\). From this new bound, it