Cancellation-Free Circuits in Unbounded and Bounded Depth

DOI10.1007/978-3-642-40164-0_17zbMath1351.94096arXiv1305.3041OpenAlexW4243859952MaRDI QIDQ2842782

Magnus Gausdal Find, Joan. Boyar

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.3041

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Separating OR, SUM, and XOR circuits, Cancellation-free circuits in unbounded and bounded depth