Limiting Negations in Formulas

DOI10.1007/978-3-642-02927-1_58zbMath1248.94133OpenAlexW1930088680MaRDI QIDQ3638074

Hiroki Morizumi

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_58

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Alternation, sparsity and sensitivity: bounds and exponential gaps ⋮ Lower bounds for Boolean circuits of bounded negation width ⋮ ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS ⋮ The minimum number of negations in circuits for systems of multi-valued functions ⋮ On the mystery of negations in circuits: structure vs power ⋮ Negation-limited formulas

This page was built for publication: Limiting Negations in Formulas