Search results

{{Short description|Unsolved problem in theoretical computer science}} In [[theoretical computer science]], the '''log-rank conjecture''' states that the deterministic [[communicat ...

{{Short description|Unsolved problem in graph theory}} ...dean plane]]. It was proposed by [[Edgar Gilbert]] and [[Henry O. Pollak]] in 1968.<ref>{{Cite journal|last1=Gilbert|first1=E. N.|last2=Pollak|first2=H. ...

{{about|the area in computer science|the area in applied mathematics|Structural complexity (applied mathematics)}} ...nguages and Programming]], 1988 (ICALP 88), ''[[Lecture Notes in Computer Science]]'', vol. 317 (1988), pp. 271-286.</ref> ...

The '''digraph realization problem''' is a [[decision problem]] in [[graph theory]]. Given pairs of nonnegative [[integer]]s <math>((a_1,b_1), ...]] constructing a special solution with the use of a [[Recursion (computer science)|recursive algorithm]]. The second one is a characterization by the [[Fulke ...

...to a [[suffix tree]], the sequence can be generated much more efficiently, in [[constant time]] per generated digit.{{r|hs09}} ....{{r|hs09}} Experimentally, however, each subsequence appears much earlier in this sequence than this upper bound would suggest: the position by which al ...

{{unsolved|mathematics|Do minor-closed graph families have <math>\ell_1</math> embeddi ...Ilan Newman, Yuri Rabinovich, and [[Alistair Sinclair]], who formulated it in 2004.{{r|gnrs}} ...

The '''graph realization problem''' is a [[decision problem]] in [[graph theory]]. Given a finite sequence <math>(d_1,\dots,d_n)</math> of n ...>d^2_{ij}</math>, match the edge weights <math>w_{ij}</math> for all edges in an incomplete, undirected, weighted graph.<ref>{{citation ...

{{Short description|Problem in computational complexity theory}} {{unsolved|computer science|Is there an algorithm for solving the OMv problem in time <math>O(n^{3-\varepsilon})</math>, for some constant <math>\varepsilon ...

In [[graph theory]], a branch of mathematics, '''graph canonization''' is the | series = Lecture Notes in Comput. Sci. ...

...nd published in 1987 in the International Series of Monographs on Computer Science of the [[Oxford University Press]].{{r|edels|vlach|avis|franklin|ryan}} Onl ...Visibility (geometry)|visibility]], decompositions of polygons, [[Covering problems|coverings of polygons]], triangulations and triangulation algorithms, and h ...

{{Short description|Unsolved problem on partial orders}} ...tensions, the bottom left element occurs prior to the bottom right element in 9 out of 27. Partial orders with this structure are the only known extreme ...

...ki difference|difference set]], the set of distances (and their negations) in collections of numbers. Several problems and results in geometry concern distance sets, usually based on the principle that a large ...

{{Short description|Seven mathematical problems with a US$1 million prize for each solution}} {{Millennium Problems}} ...

{{Short description|Problem on triangles in graph theory}} ...n by the blue and yellow vertex coloring). According to Tuza's conjecture, in any graph, it is possible to remove twice as many edges as the maximum tria ...

...rm all linear laws. The problem of finding the optimal control law remains unsolved.<ref name=Ho>Ho, Yu-Chi, "Review of the Witsenhausen problem". ''Proceeding ...tempt to control the system by attempting to bring the state close to zero in exactly two time steps. The first controller observes the initial state <ma ...

{{unsolved|computer science|Is there an <math>X + Y</math> sorting algorithm faster than <math>O(n^2 \l In [[computer science]], <math>\boldsymbol{X}+\boldsymbol{Y}</math> '''sorting''' is the problem ...

{{Short description|Problem in computer science}} {{unsolved|computer science|What is the Turing run-time complexity of the square-root sum problem?}} ...

...ethod to find a satisfying assignment is known than to try all assignments in succession. [[Stephen Cook|Cook]] and [[Leonid Levin|Levin]] proved that ea In [[computational complexity theory]], a problem is '''NP-complete''' when: ...

...er of clauses that can be satisfied by a truth assignment to the variables in the clauses. ...nt, it's not obvious how to remove its dependence on randomness. There are problems related to the satisfiability of conjunctive normal form Boolean formulas. ...

==In a square== ...|first3=János |author3-link=János Pach |year=2005 |title=Research Problems in Discrete Geometry |publisher=Springer |location=New York |isbn=978-0387-238 ...