scientific article; zbMATH DE number 7204264
From MaRDI portal
Publication:5111143
DOI10.4230/LIPIcs.CCC.2017.13zbMath1440.68131MaRDI QIDQ5111143
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityderandomizationconstant-depth circuitsquantified derandomizationhitting-set generator
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (3)
Unnamed Item ⋮ Unnamed Item ⋮ Improved bounds for quantified derandomization of constant-depth circuits and polynomials
This page was built for publication: