Sum of radicals
In computational complexity theory, there is an open problem of whether some information about a sum of radicals may be computed in polynomial time depending on the input size, i.e., in the number of bits necessary to represent this sum. It is of importance for many problems in computational geometry, since the computation of the Euclidean distance between two points in the general case involves the computation of a square root, and therefore the perimeter of a polygon or the length of a polygonal chain takes the form of a sum of radicals. where are natural numbers and are real numbers.
Link from a Wikipage to another Wikipage
primaryTopic
Sum of radicals
In computational complexity theory, there is an open problem of whether some information about a sum of radicals may be computed in polynomial time depending on the input size, i.e., in the number of bits necessary to represent this sum. It is of importance for many problems in computational geometry, since the computation of the Euclidean distance between two points in the general case involves the computation of a square root, and therefore the perimeter of a polygon or the length of a polygonal chain takes the form of a sum of radicals. where are natural numbers and are real numbers.
has abstract
En théorie de la complexité, i ...... sse NP, il est aussi en co-NP.
@fr
In computational complexity th ...... NP, then it is also in co-NP.
@en
Wikipage page ID
22,231,261
page length (characters) of wiki page
Wikipage revision ID
963,568,104
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
En théorie de la complexité, i ...... forme d'une somme de radicaux.
@fr
In computational complexity th ...... numbers and are real numbers.
@en
label
Somme de radicaux
@fr
Sum of radicals
@en