Real addition and the polynomial hierarchy

From MaRDI portal
Publication:1063589

DOI10.1016/0020-0190(85)90076-6zbMath0575.03030OpenAlexW2035496804MaRDI QIDQ1063589

Eduardo D. Sontag

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90076-6




Related Items (23)

Erratum to: ``Analyzing restricted fragments of the theory of linear arithmeticComputing over the reals with addition and orderA bibliography of quantifier elimination for real closed fieldsTemporal reasoning about fuzzy intervalsThe complexity of query evaluation in indefinite temporal constraint databasesDominoes and the complexity of subclasses of logical theoriesConstraint solving for interpolationOn the complexity of quantified linear systemsFinding Cut-Offs in Leaderless Rendez-Vous Protocols is EasySeparators in Continuous Petri NetsUnnamed ItemUnnamed ItemDecidability of Verification of Safety Properties of Spatial Families of Linear Hybrid AutomataPTIME parametric verification of safety properties for reasonable linear hybrid automataReachability relations of timed pushdown automataA complexity perspective on entailment of parameterized linear constraintsAnalyzing restricted fragments of the theory of linear arithmeticA survey of computational complexity results in systems and controlA polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systemsTractable disjunctions of linear constraints: Basic results and applications to temporal reasoningSaturation and stability in the theory of computation over the realsSimple sentences that are hard to decideContinuous One-counter Automata



Cites Work


This page was built for publication: Real addition and the polynomial hierarchy