<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2001-06-15 14:23:50Complexity classes Circuit complexity Structural complexity theory Computational resources ACC0 AC PP NC P Theoretical computer science Computational complexity theory Applied mathematics |
| A Story of Parametric Trace Slicing, Garbage and Static Analysis Giles Reger School of Computer Science, University of Manchester, UK PrePost 2017DocID: 1xW3e - View Document |
| Counterexample-guided Refinement of Template Polyhedra Sergiy Bogomolov12, Goran Frehse3, Mirco Giacobbe2, and Thomas A. Henzinger2 1 3DocID: 1xW2M - View Document |
| LIPIcs Leibniz International Proceedings in Informatics Verification and Refutation of∗ Probabilistic Specifications via GamesDocID: 1xW2u - View Document |
| Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın KuˇceraDocID: 1xW2m - View Document |
| Coarse Geometry and Randomness Itai Benjamini October 30, 2013 Contents 1 Introductory graph and metric notionsDocID: 1xW27 - View Document |