Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
125 views

Integration in polynomial time

The work of Friedman and Ko and Müller guarantee the polynomial time computability of the integrals of analytic functions inside the circle of convergence. But do algorithms have practical value? Is ...
poeaqnwgo's user avatar
2 votes
0 answers
103 views

Buridan's principle in computable analysis

In (Lamport, 2012), Lamport proposes the principle A discrete decision based upon an input having a continuous range of values cannot be made within a bounded length of time. I think it could be ...
MaudPieTheRocktorate's user avatar
17 votes
1 answer
874 views

An NP-hard $n$ fold integral

We are given rational numbers $[c_1, c_2, \ldots, c_n]$ and $v$ from the interval $[0,1]$. Consider the $n$-fold integral $$ J = \int_{\theta_1 \in I_1, \theta_2 \in I_2 \ldots, \theta_n \in I_n} d\...
Ganesh's user avatar
  • 627
11 votes
1 answer
420 views

The complexity of the leading fractional bit of a power of a rational number

On a mailing list (math-fun) that I subscribe to Dan Asimov asked what's the most efficient way to calculate the leading decimal digits (say 10 of them) of $(p/q)^n \bmod 1$ where $p$ and $q$ are ...
Victor Miller's user avatar