相关论文: A polynomial-time heuristic for Circuit-SAT
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
We take an order-theoretic approach to circuit (string diagram) syntax, treating a circuit as a partial order with additional input-output structure. We define morphisms between circuits and prove a factorisation theorem showing that these…
We show within the framework of relativistic quantum tasks that the doability of any task is fully determined by a small subset of its parameters that we call its "coarse causal structure", as well as the distributed computation it aims to…
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…
Classical trajectories are calculated for two Hamiltonian systems with ring shaped potentials. Both systems are super-integrable, but not maximally super-integrable, having four globally defined single valued integrals of motion each. All…
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
We prove a strongly polynomial bound on the circuit diameter of polyhedra, resolving the circuit analogue of the polynomial Hirsch conjecture. Specifically, we show that the circuit diameter of a polyhedron $P = \{x\in \mathbb{R}^n:\, A x =…
A nonlinear cyclic system with delay and the overall negative feedback is considered. The characteristic equation of the linearized system is studied in detail. Sufficient conditions for the oscillation of all solutions and for the…
The following problem is considered. A Turing machine $M$, that accepts a string of fixed length $t$ as input, runs for a time not exceeding a fixed value $n$ and is guaranteed to produce a binary output, is given. It's required to find a…
It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.
The fundamental proposal in this article is that logical formulas of the form (f <-> ~f) are not contradictions, and that formulas of the form (t <-> t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead…
The determination of a differential equation underlying a measured time series is a frequently arising task in nonlinear time series analysis. In the validation of a proposed model one often faces the dilemma that it is hard to decide…
In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard…
"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…
We bring together the semiclassical approximation, matrix integrals and the theory of symmetric polynomials in order to solve a long standing problem in the field of quantum chaos: to compute transport moments when tunnel barriers are…
We provide a polynomial time algorithm to determine a cubic bipartite graph has a hamilton cycle or not.
We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function $f$ is characterized by the partial…
Under very general conditions the hitting time of a set by a stochastic process is a stopping time. We give a new simple proof of this fact. The section theorems for optional and predictable sets are easy corollaries of the proof.