scientific article; zbMATH DE number 7378387

DOI10.4230/LIPIcs.MFCS.2018.70MaRDI QIDQ5005174

Jenish C. Mehta

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1703.00043

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

zbMATH Keywords

lower boundsdecision treeresilienceswitching lemmastree tribes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• \(\Sigma_ 1^ 1\)-formulae on finite structures
• Parity, circuits, and the polynomial-time hierarchy
• On the Correlation of Parity and Small-Depth Circuits
• Poly-logarithmic Frege depth lower bounds via an expander switching lemma
• Natural proofs

This page was built for publication: