Search results
Results from the WOW.Com Content Network
In the ray tracing problem for a 3-dimensional system of reflective or refractive objects, determining if a ray beginning at a given position and direction eventually reaches a certain point. [ 16 ] Determining if a particle path of an ideal fluid on a three dimensional domain eventually reaches a certain region in space.
What is the lowest possible average-case time complexity of Shellsort with a deterministic fixed gap sequence? Can 3SUM be solved in strongly sub-quadratic time, that is, in time O(n 2−ϵ) for some ϵ>0? Can the edit distance between two strings of length n be computed in strongly sub-quadratic time?
The impossibility of the case A = 1 or B = 1 is implied by Catalan's conjecture, proven in 2002 by Preda Mihăilescu. (Notice C cannot be 1, or one of A and B must be 0, which is not permitted.) A potential class of solutions to the equation, namely those with A, B, C also forming a Pythagorean triple, were considered by L. Jesmanowicz in the ...
In most cases, the distance between two nodes in the TSP network is the same in both directions. The case where the distance from A to B is not equal to the distance from B to A is called asymmetric TSP. A practical application of an asymmetric TSP is route optimization using street-level routing (which is made asymmetric by one-way streets ...
The standard Collatz function is given by P = 2, a 0 = 1 / 2 , b 0 = 0, a 1 = 3, b 1 = 1. Conway proved that the problem Given g and n, does the sequence of iterates g k (n) reach 1? is undecidable, by representing the halting problem in this way. Closer to the Collatz problem is the following universally quantified problem:
Hadamard's maximal determinant problem, named after Jacques Hadamard, asks for the largest determinant of a matrix with elements equal to 1 or −1. The analogous question for matrices with elements equal to 0 or 1 is equivalent since, as will be shown below, the maximal determinant of a {1,−1} matrix of size n is 2 n−1 times the maximal determinant of a {0,1} matrix of size n−1.
The expression problem is a challenging problem in programming languages that concerns the extensibility and modularity of statically typed data abstractions. The goal is to define a data abstraction that is extensible both in its representations and its behaviors, where one can add new representations and new behaviors to the data abstraction, without recompiling existing code, and while ...
B is pardoned and the warden mentions C to be executed: 1 / 3 of the cases; C is pardoned and the warden mentions B to be executed: 1 / 3 of the cases; With the stipulation that the warden will choose randomly, in the 1 / 3 of the time that A is to be pardoned, there is a 1 / 2 chance he will say B and 1 / 2 ...