相关论文: A polynomial-time heuristic for Circuit-SAT
In this work, we summarize and critique the paper "Understanding SAT is in P" by Alejandro S\'anchez Guinea [arXiv:1504.00337]. The paper claims to present a polynomial-time solution for the NP-complete language 3-SAT. We show that Guinea's…
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…
This article presents a simple port-Hamiltonian formulation of the equations for an RLC electric circuit as a differential-algebraic equation system, and a proof that structural analysis always succeeds on it for a well-posed circuit, thus…
Polymorphic circuits are a special kind of circuits which possess some different build-in functions and these functions are activated by environment parameters, like light and VDD. Some theories have been proposed to guide the design of…
We introduce circulance, a scalar measure for classifying time series of dynamical systems. Circulance captures the extent of temporal regularity or irregularity that is encoded in the topology of a directed ordinal pattern transition…
We furnish solid evidence, both theoretical and empirical, towards the existence of a deterministic algorithm for random sparse $\#\Omega(\log n)$-SAT instances, which computes the exact counting of satisfying assignments in sub-exponential…
The operator and the functional formulations of the dynamics of constrained systems are explored for determining unambiguously the quantum Hamiltonian of a nonrelativistic particle in a curved space.
We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…
We study a polynomial-time decision problem in which each input encodes a depth-$N$ causal execution in which a single non-duplicable token must traverse an ordered sequence of steps, revealing at most $O(1)$ bits of routing information at…
Limits on the number of satisfying assignments for CNS instances with n variables and m clauses are derived from various inequalities. Some bounds can be calculated in polynomial time, sharper bounds demand information about the…
The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…
This paper proves that non-convex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. When this condition is…
A backdoor set is a set of variables of a propositional formula such that fixing the truth values of the variables in the backdoor set moves the formula into some polynomial-time decidable class. If we know a small backdoor set we can…
The time ordering of two spacelike separated events is arbitrary, when all inertial frames are taken into account, but for three or more events it is not generally so. We determine the structure of possible time orderings, or chronologies,…
Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well-understood that any non-trivial problem studied is undecidable…
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…
We consider the cyclotomic identity testing (CIT) problem: given a polynomial $f(x_1,\ldots,x_k)$, decide whether $f(\zeta_n^{e_1},\ldots,\zeta_n^{e_k})$ is zero, where $\zeta_n = e^{2\pi i/n}$ is a primitive complex $n$-th root of unity…
A {+,x}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same as those of f; on other inputs the circuit may output arbitrary values. Such a circuit counts the number of monomials of f evaluated to 1 by…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…