相关论文: A polynomial-time heuristic for Circuit-SAT

A powerful tool is developed for the characterization of chaotic signals. The approach is based on the symbolic encoding of time series (according to their ordinal patterns) combined with the ensuing characterization of the corresponding…

In this paper, we present a method for the Hamiltonian simulation in the context of eigenvalue estimation problems which improves earlier results dealing with Hamiltonian simulation through the truncated Taylor series. In particular, we…

People reason heuristically in situations resembling inferential puzzles such as Bertrand's box paradox and the Monty Hall problem. The practical significance of that fact for economic decision making is uncertain because a departure from…

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…

A graph $G$ is a circle graph if it is an intersection graph of chords of a unit circle. We give an algorithm that takes as input an $n$ vertex circle graph $G$, runs in time at most $n^{O(\log n)}$ and finds a proper $3$-coloring of $G$,…

Mutual coherence is a measure of similarity between two opinions. Although the notion comes from philosophy, it is essential for a wide range of technologies, e.g., the Wahl-O-Mat system. In Germany, this system helps voters to find…

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…

Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the…

Gauge invariance of systems whose Hamilton-Jacobi equation is separable is improved by adding surface terms to the action fuctional. The general form of these terms is given for some complete solutions of the Hamilton-Jacobi equation. The…

Starting from the canonical formalism of relativistic (timeless) quantum mechanics, the formulation of timeless path integral is rigorously derived. The transition amplitude is reformulated as the sum, or functional integral, over all…

Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…

In general-covariant theories the Hamiltonian is a constraint, and hence there is no time evolution; this is the problem of time. In the subcritical free string, the Hamiltonian ceases to be a constraint after quantization due to conformal…

We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…

The Hamiltonian description for a wide class of mechanical systems, having local symmetry transformations depending on time derivatives of the gauge parameters of arbitrary order, is constructed. The Poisson brackets of the Hamiltonian and…

This paper summarises a numerical investigation which aimed to identify and characterise regular and chaotic behaviour in time-dependent Hamiltonians H(r,p,t) = p^2/2 + U(r,t), with U=R(t)V(r) or U=V[R(t)r], where V(r) is a polynomial in x,…

A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and…

When a Hamiltonian system is subject to constraints which depend explicitly on time, difficulties can arise in attempting to reduce the system to its physical phase space. Specifically, it is non-trivial to restrict the system in such a way…

The present article introduces ptarithmetic (short for "polynomial time arithmetic") -- a formal number theory similar to the well known Peano arithmetic, but based on the recently born computability logic (see…

We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For…