Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let R be the set of Kolmogorov-random strings, and let t be a proof-length bound for statements asserting that no proof of x∈ R has length at most t. Exhaustive-search conjecture. Conditional program logic and case-based reasoning are…
Let V be the vector space with the second-order multilinear operation defined in the source, and let *colon V× V→ V. For a fixed vector a∈ V and a positive integer n, write a^n:=underbracea*a*…*a_n times. Hardness conjecture for the…
Let d54f A be a finite relational structure, and let CSP( A) denote the decision problem asking whether an input structure of the same type admits a homomorphism to A. The CSP dichotomy conjecture. For every finite relational structure A,…
Let A be drawn from the (m,n,1/2)-Bernoulli ensemble, where C is a universal constant and n≥ C mlog m. Computational hardness conjecture. With high probability, no efficient algorithm finds a solution of constant discrepancy for A.The…
Let F_k(n,m) denote the random k-SAT formula on n variables with m clauses, and let α=m/n be the clause density. Write α_sat(k) for a putative critical density. Chvátal–Reed conjecture. For all k≥ 2 there exists a value α_sat(k)>0 such…
Let M be a finitely presented special monoid, generated by A, with virtually free group of units. For inputs u,v∈ A^*, write n=|u|+|v|. Quadratic-time word problem conjecture. The word problem for M is decidable in O(n^2) time. Matrix…
Let M(n) denote the time complexity of multiplying two n-bit integers. The self-correcting algorithm described in the paper computes pi with error O(2^-n). Fast self-correcting pi algorithm conjecture. Algorithm~ runs in O(M(n)log n) bit…
Let k-Frobenius Problem denote the problem defined earlier in the source. The fixed-dimensional k-Frobenius Problem hardness conjecture. The k-Frobenius Problem is NP-hard for some fixed n. The source describes this as a significantly…
A constraint satisfaction problem (CSP) is a computational problem of deciding whether a finite set of variables can be assigned values from a finite domain so that all specified constraints are satisfied. The notation “simulate” refers to…
Let H' be a graph, and let H be a block graph of H', meaning a graph obtained from H' by replacing each block according to the block construction used in the paper. The problem sc H-Cover asks whether a simple input graph admits a cover…
Let F_r be a free group, let NMin⊂ F_r be the set of non-minimal elements, and let WC(w) denote Whitehead complexity. Polynomial Whitehead-descent time-complexity conjecture. The time complexity, or at least the average-case time…
Let a variety be a class of algebras defined by identities, let Z be a fixed algebra, and consider the Exists Right-Factor Problem for homomorphism factorization with fixed algebra Z. A variety has bounded f-cores if there is a bound on…
Let Q⊆ R^n be a polyhedral cone, and let rm MA(P,Q) denote the problem of computing the maximal angle between cones P and Q. Orthant-restriction conjecture. Computing the maximal angle between R^n_+ and a polyhedral cone Q⊆ R^n is NP-hard,…
Let A be an alphabet, let 1≤ k<n, and let g∈Sym(A^k) and h∈Sym(A^n-k). Define f∈Sym(A^n) by (f_1(x),…,f_k(x))=g(x_1,…,x_k) and (f_k+1(x),…,f_n(x))=h(x_k+1,…,x_n). Here L(u) denotes the minimum instruction length of a program computing the…
A triangulation T is a finite triangulation of a closed 3-manifold, and S^3 recognition asks whether T triangulates the 3-sphere. The complexity class coNP consists of decision problems whose complements lie in NP. The coNP conjecture for…
For a fixed positive integer r, let the r^th Divisorial Gonality problem ask whether a graph has divisorial gonality at most a given integer, and let the r^th Stable Divisorial Gonality problem ask the analogous question after allowing…
Let w be a closed braid with a fixed number of strands, and measure complexity with respect to the number of crossings of w. Polynomial-time Khovanov conjecture. Computing the Khovanov homology of w and determining the homotopy type of the…
A binary matroid is a matroid representable over the two-element field. The 2-SPANNING-CIRCUIT problem asks whether a matroid has a circuit containing two specified elements. 2-SPANNING-CIRCUIT conjecture. 2-SPANNING-CIRCUIT is NP-complete…
Let A=⟨ A;R⟩ be a finite core relational structure of finite relational signature. A polymorphism of A is an operation that is a homomorphism from a direct power of A to A. A weak near unanimity operation (WNU) is an idempotent operation…
Let L be a computational problem, let T_L(n) denote its time complexity, and let h(L) denote its homological complexity. Homological Time Complexity Relation. There exists a polynomial p such that, for every computational problem L,…