Here we develop a polynomial time algorithm that provably finds the ground state of any 1D quantum system described by a gapped local Hamiltonian with constant ground-state energy. The algorithm ...

At its core, the study of polynomial time algorithms seeks procedures that can resolve intricate problems within a time frame that scales polynomially with the size of the input. This framework ...

The amount of time it takes for an algorithm to solve a polynomial function, which is a mathematical expression that does not contain fractions or negative numbers. The time is proportional to the ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...

The award was made in recognition of their paper A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, which they had presented at the STOC meeting two ...

We will consider both normative properties (such as axioms and fairness requirements) and algorithmic aspects of the proposed solutions (polynomial-time algorithms and NP-hardness results) Syllabus.

This is an instance of a problem that would be in the NP category, or nondeterministic polynomial time algorithms. The time needed for verifying a yes instance of problem grows as a constant power ...

Now, Babai has taken what appears to be a major step forward in pinning down the problem’s difficulty level, by setting forth what he asserts is a “quasi-polynomial-time” algorithm to solve it.