Search results

...tails, see [[chronology of computation of π|Chronology of computation of {{pi}}]]. ...(1777–1855) and [[Adrien-Marie Legendre]] (1752–1833) combined with modern algorithms for multiplication and [[square root]]s. It repeatedly replaces two numbers ...

...[[mathematical constant]]s, in particular, [[computing π|computing {{mvar|π}}]]. M(x,y) &= \frac{\pi}{2} \left( \int_0^\frac{\pi}{2}\frac{d\theta}{\sqrt{x^2\cos^2\theta+y^2\sin^2\theta}} \right)^{-1}\\ ...

U(f) &\triangleq \mathcal{F}\{u\}(f) = \int_{-\infty}^{\infty}u(x) e^{-i 2 \pi f x} \, dx, \quad f \in \mathbb{R}\\[1ex] V(f) &\triangleq \mathcal{F}\{v\}(f) = \int_{-\infty}^{\infty}v(x) e^{-i 2 \pi f x} \, dx, \quad f \in \mathbb{R} ...

| [[circle]] || <math>2 \pi r = \pi d</math> || where <math>r</math> is the radius of the circle and <math>d</m | [[semicircle]] || <math>(\pi+2)r </math>|| where <math>r</math> is the radius of the semicircle. ...

...ll initial orders of the list, satisfies <math>ES^T \le ES^{MF} \le \frac{\pi}{2}ES^{OPT}</math>. | title = Algorithms and Theory of Computation Handbook ...

<math display="block">Z_0 = R \cos(\Theta) =\sqrt{-2 \ln U_1} \cos(2 \pi U_2)\,</math> <math display="block">Z_1 = R \sin(\Theta) = \sqrt{-2 \ln U_1} \sin(2 \pi U_2).\,</math> ...

:<math>\Phi(u) = \sum_{n=1}^{\infty} (2\pi^2n^4e^{9u}-3\pi n^2 e^{5u} ) e^{-\pi n^2 e^{4u}}</math> ...jn–Newman Constant is Non-Negative|date=2020|journal=Forum of Mathematics, Pi|language=en|volume=8|article-number=e6|doi=10.1017/fmp.2020.6|issn=2050-508 ...

...ject from Texas Instruments engineers, [[Nigel Searle]] was able to design algorithms that sacrificed some speed and accuracy in order to implement scientific fu ...ref> However, by sacrificing some speed and accuracy, Sinclair used clever algorithms to run scientific operations on a chip with room for just 320 instructions. ...

| dialects = [[occam-π]] (pi) ...e to express useful programs, whereas occam 1 was more suited to examining algorithms and exploring the new language (however, the occam 1 [[compiler]] was writt ...

<math display="block">V(r, h) = \frac{\pi r^2 h}{3}.</math> <math display="block">\frac{ \partial V}{\partial r} = \frac{ 2 \pi r h}{3},</math> ...

...s whether the guess is a solution to the problem.<ref>Alsuwaiyel, M. H.: ''Algorithms: Design Techniques and Analysis'', [https://books.google.com/books?id=SPx4i ...hat the answer is "yes" or "no" in polynomial time otherwise, then <math> \Pi </math> is in NP. ...

...> is the function that maps any element ''x'' of the set to <math>\sigma (\pi (x))</math>. Note that the rightmost permutation is applied to the argument ...ion, the product is given by <math>x ^{\sigma \cdot \pi} = (x ^{\sigma})^{\pi}</math>.<ref> ...

...ublications]] to document algorithms and in planning of software and other algorithms. ...related to [[computer science]] and [[numerical computation]] to describe algorithms in a way that is accessible to programmers regardless of their familiarity ...

...i=10.1137/s0097539796300933|arxiv=quant-ph/9701001}}</ref> Since classical algorithms for [[NP-completeness|NP-complete problems]] require exponentially many ste ...poses a significantly increased risk to encryption over existing classical algorithms, however.<ref name="djb-groverr">{{cite conference ...

Metropolis–Hastings and other MCMC algorithms are generally used for sampling from multi-dimensional distributions, espec ...ndependent samples from a distribution, Metropolis–Hastings and other MCMC algorithms have a number of disadvantages: ...

...ft(\frac{a}{p}\right)\sum_{k=0}^{p-1}\zeta^{k^2},\qquad \zeta = e^{\frac{2\pi i}{p}}</math> ...\frac{p-1}{2}} \frac{\sin\left(\frac{2\pi qn}{p}\right)}{\sin\left(\frac{2\pi n}{p}\right)}.</math> ...

<math display="block"> \Pi(n ; \varphi \setminus \alpha) = \int_0^\varphi \frac{1}{1-n\sin^2 \theta} \ <math display="block"> \Pi(n ; \varphi \,|\,m) = \int_{0}^{\sin \varphi} \frac{1}{1-nt^2} \frac{dt}{\s ...

| title = The computation of previously inaccessible digits of <math>\pi^2</math> and Catalan's constant ...= \sum_{n=0}^\infty \frac{1}{(4n+1)^2}.</math><math display="block">\frac{\pi^2}{16}-\frac G2 = \sum_{n=0}^\infty \frac{1}{(4n+3)^2}.</math> ...

...lete factorization, but it is the first step of all standard factorization algorithms. }}</ref> In contrast, polynomial-time algorithms are known for [[primality testing]].<ref>{{Cite journal|last1=Agrawal|first ...

There are more efficient factoring algorithms. However they remain relatively inefficient, as, with the present state of <math display="block">e^{2ik\pi/n} = \cos \tfrac{2\pi k}n + i\sin \tfrac{2\pi k} n </math> ...