Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps

DOI10.1007/978-3-319-74180-2_22zbMath1497.68229OpenAlexW2784077923MaRDI QIDQ2636568

Krishnamoorthy Dinesh, M. N. Jayalal Sarma

Publication date: 5 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-74180-2_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Boolean functions (06E30)

Related Items (3)

Unnamed Item ⋮ New bounds for energy complexity of Boolean functions ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity

This page was built for publication: Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps