Titlebook: Mathematical Foundations of Computer Science 2011; 36th International S Filip Murlak,Piotr Sankowski Conference proceedings 2011 Springer-V

Mutter

Verifying Proofs in Constant Depthanguages ranging from regular to .-complete. On the other hand, we show by combinatorial methods that even easy regular languages such as Exact-OR do not admit . proof systems. We also present a general construction of . proof systems for regular languages with strongly connected NFA’s.

Alienated

The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degrees for planar DAGs of bounded degree. For particular subclasses of planar graphs of bounded degree and for variants thereof, we also provide algorithms that allow for polynomial-time evaluation of the cover polynomials at certain new points by utilizing Valiant’s holographic framework.

矛盾心理

收到

吞噬

清醒

Trypsin

軍械庫

jocular

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domainsover . domains of ?. and ?., under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension to the complex plane.

Alveoli