Publication:4992878

zbMath1462.68038arXiv1212.3282MaRDI QIDQ4992878

Damien Woods, Niall Murphy

Publication date: 10 June 2021

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

zbMATH Keywords

computational complexity; uniform Boolean circuits; AND circuits; OR circuits

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

68Q06: Networks and circuits as models of computation; circuit complexity

Related Items

Parallel computation using active self-assembly