scientific article
From MaRDI portal
Publication:3002829
DOI10.4086/toc.2011.v007a004zbMath1213.68416OpenAlexW2278710187MaRDI QIDQ3002829
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2011.v007a004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (9)
Expander-based cryptography meets natural proofs ⋮ Approximating Boolean Functions with Depth-2 Circuits ⋮ DNF sparsification and a faster deterministic counting algorithm ⋮ Boolean nested canalizing functions: a comprehensive analysis ⋮ Minterm-transitive functions with asymptotically smallest block sensitivity ⋮ Unnamed Item ⋮ On extremal \(k\)-CNF formulas ⋮ The simplified weighted sum function and its average sensitivity ⋮ Criticality of regular formulas
This page was built for publication:
