Isolating and odd number of elements and applications in complexity theory

DOI10.1007/s002240000075zbMath0894.68062OpenAlexW2010191714WikidataQ114230791 ScholiaQ114230791MaRDI QIDQ1384703

D. Massart

Publication date: 25 May 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000075

zbMATH Keywords

complexity theory\(\text{AC}^0\) circuits

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems ⋮ Is Valiant-Vazirani's isolation probability improvable?

This page was built for publication: Isolating and odd number of elements and applications in complexity theory