scientific article; zbMATH DE number 7204256

DOI10.4230/LIPIcs.CCC.2017.5zbMath1440.68076MaRDI QIDQ5111135

Gautam Prakriya, Dieter van Melkebeek

Publication date: 26 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

derandomizationisolation lemmagraph reachabilitycircuit certificationunambiguous nondeterminism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (5)

Unnamed Item ⋮ Compressed Decision Problems in Hyperbolic Groups. ⋮ Typically-correct derandomization for small time and space ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

This page was built for publication: