Search Results for ""
11 - 20 of 1570 for Napoleon's_problemSearch Results
View search results from all Wolfram sites (160175 matches)The inner Napoleon triangle is the triangle DeltaN_AN_BN_C formed by the centers of internally erected equilateral triangles DeltaABE_C, DeltaACE_B, and DeltaBCE_A on the ...
The problem of determining (or counting) the set of all solutions to a given problem.
Given the "peaks" of three equilateral triangles placed on the sides of a triangle T, construct T. The problem was proposed by Lemoine (1868) and solved for the general case ...
Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...
The question of whether a solution to a given problem exists. The existence problem can be solved in the affirmative without actually finding a solution to the original ...
A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...
A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...
A problem in the theory of algebraic invariants that was solved by Hilbert using an existence proof.
The problem of deciding if two knots in three-space are equivalent such that one can be continuously deformed into another.
...