No. Title Author Year
1 Polynomial Identity Testing via Evaluation of Rational Functions van Melkebeek, Dieter et al. 2022
2 Minimum Circuit Size, Graph Isomorphism, and Related Problems Allender, Eric et al. 2018
3 Derandomizing Isolation in Space-Bounded Settings van Melkebeek, Dieter et al. 2017
4 Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) Grohe, Martin et al. 2011
5 Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses Dell, Holger et al. 2010
6 08381 Abstracts Collection -- Computational Complexity of Discrete Problems Miltersen, Peter Bro et al. 2008
7 08381 Executive Summary -- Computational Complexity of Discrete Problems Miltersen, Peter Bro et al. 2008
8 Space Hierarchy Results for Randomized Models Kinne, Jeff et al. 2008
9 06111 Abstracts Collection -- Complexity of Boolean Functions Krause, Matthias et al. 2006
10 06111 Executive Summary -- Complexity of Boolean Functions Krause, Matthias et al. 2006
11 A Generic Time Hierarchy for Semantic Models With One Bit of Advice van Melkebeek, Dieter et al. 2006
12 Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines Diehl, Scott et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI