Search results
Results from the WOW.Com Content Network
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?
Moret, B. M. E.; H. D. Shapiro (1991). Algorithms from P to NP, volume 1 - Design and Efficiency . Redwood City, California: Benjamin/Cummings Publishing Company, Inc. Discusses intractability of problems with algorithms having exponential performance in Chapter 2, "Mathematical techniques for the analysis of algorithms."
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 ...
Theorem 2.2 There exists a Turing machine whose halting problem is recursively unsolvable. A related problem is the printing problem for a simple Turing machine Z with respect to a symbol S i ". A possible precursor to Davis's formulation is Kleene's 1952 statement, which differs only in wording: [ 19 ] [ 22 ]
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 ...
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.
For example, for 2 5 a + 1 there are 3 increases as 1 iterates to 2, 1, 2, 1, and finally to 2 so the result is 3 3 a + 2; for 2 2 a + 1 there is only 1 increase as 1 rises to 2 and falls to 1 so the result is 3a + 1. When b is 2 k − 1 then there will be k rises and the result will be 3 k a + 3 k − 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 ...