33,126 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
Query Order and the Polynomial Hierarchy
Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of
query order, which studies the ways in which computational power is affected by
the order in which information sources are accessed. The present paper studies,
for the first time, query order as it applies to the levels of the polynomial
hierarchy. We prove that the levels of the polynomial hierarchy are
order-oblivious. Yet, we also show that these ordered query classes form new
levels in the polynomial hierarchy unless the polynomial hierarchy collapses.
We prove that all leaf language classes - and thus essentially all standard
complexity classes - inherit all order-obliviousness results that hold for P.Comment: 14 page
Control problems and the polynomial time hierarchy
Classifies control problems by exhibiting their alternating quantifier structure. This classification allows the authors to relate these control problems to the computational complexity classes of the polynomial time hierarchy. A specific synthesis problem for uncertain systems is shown to be hard in the class II^p_2
Positive trigonometric polynomials for strong stability of difference equations
We follow a polynomial approach to analyse strong stability of linear
difference equations with rationally independent delays. Upon application of
the Hermite stability criterion on the discrete-time homogeneous characteristic
polynomial, assessing strong stability amounts to deciding positive
definiteness of a multivariate trigonometric polynomial matrix. This latter
problem is addressed with a converging hierarchy of linear matrix inequalities
(LMIs). Numerical experiments indicate that certificates of strong stability
can be obtained at a reasonable computational cost for state dimension and
number of delays not exceeding 4 or 5
- …