Stefan Heinrich
Universität Kaiserslautern, Germany
Random and quantum bit complexity of integration problems
Abstract:
We recall some old and discuss some new results on the complexity of various
integration problems in the restricted randomized setting of IBC, meaning
that the considered algorithms have access to randomness only via a sequence
of independent random bits. The new results are joint work with Mario Hefter
and Klaus Ritter.
Furthermore, certain connections to the qubit complexity in the quantum
setting of IBC will be discussed.
<< back