Monotone real circuits are more powerful than monotone Boolean circuits

DOI10.1016/S0020-0190(97)00007-0zbMath1337.68103OpenAlexW2061814869MaRDI QIDQ290209

Arnold Rosenbloom

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00007-0

zbMATH Keywords

computational complexitycircuit complexityBoolean circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Discretely ordered modules as a first-order extension of the cutting planes proof system ⋮ Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes ⋮ On the minimum number of negations leading to super-polynomial savings

Cites Work

• The monotone circuit complexity of Boolean functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monotone real circuits are more powerful than monotone Boolean circuits