290 research outputs found
The polynomial-time hierarchy
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarchy in which deterministic (nondeterministic) polynomial time plays the role of recursive (recursively enumerable) time. Known properties of the polynomial-time hierarchy are summarized. A word problem which is complete in the second stage of the hierarchy is exhibited. In the analogy between the polynomial-time hierarchy and the arithmetical hierarchy, the first order theory of equality plays the role of elementary arithmetic (as the ω-jump of the hierarchy). The problem of deciding validity in the theory of equality is shown to be complete in polynomial-space, and close upper and lower bounds on the space complexity of this problem are established
A characterization of the power of vector machines
A new formal model of register machines is described. Registers contain bit vectorswhich are manipulated using bitwise Boolean operations and shifts. Our main results relate the language recognition power of such vector machines to that of Turing machines. A class of vector machines is exhibited for which time on a vector machine supplies, to within a polynomial, just as much power as space on a Turing machine. Moreover, this is true regardless of whether the machines are deterministic or non-deterministic
Spin-injection Hall effect in a planar photovoltaic cell
Successful incorporation of the spin degree of freedom in semiconductor
technology requires the development of a new paradigm allowing for a scalable,
non-destructive electrical detection of the spin-polarization of injected
charge carriers as they propagate along the semiconducting channel. In this
paper we report the observation of a spin-injection Hall effect (SIHE) which
exploits the quantum-relativistic nature of spin-charge transport and which
meets all these key requirements on the spin detection. The two-dimensional
electron-hole gas photo-voltaic cell we designed to observe the SIHE allows us
to develop a quantitative microscopic theory of the phenomenon and to
demonstrate its direct application in optoelectronics. We report an
experimental realization of a non-magnetic spin-photovoltaic effect via the
SIHE, rendering our device an electrical polarimeter which directly converts
the degree of circular polarization of light to a voltage signal.Comment: 14 pages, 4 figure
Multiparticle equations for interacting Dirac fermions in magnetically confined graphene quantum dots
We study the energy of quasi-particles in graphene within the Hartree-Fock approximation. The quasi-particles are confined via an inhomogeneous magnetic field and interact via the Coulomb potential. We show that the associated functional has a minimizer and determines the stability conditions for the N-particle problem in such a graphene quantum dot
Exponential localization of hydrogen-like atoms in relativistic quantum electrodynamics
We consider two different models of a hydrogenic atom in a quantized
electromagnetic field that treat the electron relativistically. The first one
is a no-pair model in the free picture, the second one is given by the
semi-relativistic Pauli-Fierz Hamiltonian. We prove that the no-pair operator
is semi-bounded below and that its spectral subspaces corresponding to energies
below the ionization threshold are exponentially localized. Both results hold
true, for arbitrary values of the fine-structure constant, , and the
ultra-violet cut-off, , and for all nuclear charges less than the
critical charge without radiation field, . We obtain
similar results for the semi-relativistic Pauli-Fierz operator, again for all
values of and and for nuclear charges less than .Comment: 37 page
Hitting all Maximal Independent Sets of a Bipartite Graph
We prove that given a bipartite graph G with vertex set V and an integer k,
deciding whether there exists a subset of V of size k hitting all maximal
independent sets of G is complete for the class Sigma_2^P.Comment: v3: minor chang
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by
abstract interpretation. Our method eschews two traditional sources of
imprecision: (i) the use of widening operators for enforcing convergence within
a finite number of iterations (ii) the use of merge operations (often, convex
hulls) at the merge points of the control flow graph. It instead computes the
least inductive invariant expressible in the domain at a restricted set of
program points, and analyzes the rest of the code en bloc. We emphasize that we
compute this inductive invariant precisely. For that we extend the strategy
improvement algorithm of [Gawlitza and Seidl, 2007]. If we applied their method
directly, we would have to solve an exponentially sized system of abstract
semantic equations, resulting in memory exhaustion. Instead, we keep the system
implicit and discover strategy improvements using SAT modulo real linear
arithmetic (SMT). For evaluating strategies we use linear programming. Our
algorithm has low polynomial space complexity and performs for contrived
examples in the worst case exponentially many strategy improvement steps; this
is unsurprising, since we show that the associated abstract reachability
problem is Pi-p-2-complete
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3-dimensional
Euclidean space is unknotted, capable of being continuously deformed without
self-intersection so that it lies in a plane. We show that this problem, {\sc
unknotting problem} is in {\bf NP}. We also consider the problem, {\sc
unknotting problem} of determining whether two or more such polygons can be
split, or continuously deformed without self-intersection so that they occupy
both sides of a plane without intersecting it. We show that it also is in NP.
Finally, we show that the problem of determining the genus of a polygonal knot
(a generalization of the problem of determining whether it is unknotted) is in
{\bf PSPACE}. We also give exponential worst-case running time bounds for
deterministic algorithms to solve each of these problems. These algorithms are
based on the use of normal surfaces and decision procedures due to W. Haken,
with recent extensions by W. Jaco and J. L. Tollefson.Comment: 32 pages, 1 figur
Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions
In this paper we turn the spotlight on a class of lexicographic ranking
functions introduced by Bradley, Manna and Sipma in a seminal CAV 2005 paper,
and establish for the first time the complexity of some problems involving the
inference of such functions for linear-constraint loops (without precondition).
We show that finding such a function, if one exists, can be done in polynomial
time in a way which is sound and complete when the variables range over the
rationals (or reals). We show that when variables range over the integers, the
problem is harder -- deciding the existence of a ranking function is
coNP-complete. Next, we study the problem of minimizing the number of
components in the ranking function (a.k.a. the dimension). This number is
interesting in contexts like computing iteration bounds and loop
parallelization. Surprisingly, and unlike the situation for some other classes
of lexicographic ranking functions, we find that even deciding whether a
two-component ranking function exists is harder than the unrestricted problem:
NP-complete over the rationals and -complete over the integers.Comment: Technical report for a corresponding CAV'15 pape
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation
from a logical point of view. For each logic L we introduce a new logic BPL,
bounded error probabilistic L, which is defined from L in a similar way as the
complexity class BPP, bounded error probabilistic polynomial time, is defined
from PTIME. Our main focus lies on questions of derandomisation, and we prove
that there is a query which is definable in BPFO, the probabilistic version of
first-order logic, but not in Cinf, finite variable infinitary logic with
counting. This implies that many of the standard logics of finite model theory,
like transitive closure logic and fixed-point logic, both with and without
counting, cannot be derandomised. Similarly, we present a query on ordered
structures which is definable in BPFO but not in monadic second-order logic,
and a query on additive structures which is definable in BPFO but not in FO.
The latter of these queries shows that certain uniform variants of AC0
(bounded-depth polynomial sized circuits) cannot be derandomised. These results
are in contrast to the general belief that most standard complexity classes can
be derandomised. Finally, we note that BPIFP+C, the probabilistic version of
fixed-point logic with counting, captures the complexity class BPP, even on
unordered structures
- …