On constant depth circuits parameterized by degree: identity testing and depth reduction

DOI10.1007/978-3-319-62389-4_21zbMath1434.68180OpenAlexW2730365480MaRDI QIDQ2412414

Purnata Ghosal, Om Prakash, B. V. Raghavendra Rao

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Networks and circuits as models of computation; circuit complexity (68Q06) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models

This page was built for publication: On constant depth circuits parameterized by degree: identity testing and depth reduction