Search Results - "Boolean function complexity theory"

The complexity of the parity function in unbounded fan-in, unbounded depth circuits

Authors: Ingo Wegener

Source: Theoretical Computer Science. 85:155-170

Subject Terms: unbounded fan-in Boolean circuits, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, Boolean function complexity theory, 0102 computer and information sciences, complexity measure, 0101 mathematics, 01 natural sciences, complexity of the parity function, Theoretical Computer Science, Computer Science(all)

File Description: application/xml

Access URL: https://zbmath.org/33394
https://doi.org/10.1016/0304-3975(91)90052-4
https://dblp.uni-trier.de/db/journals/tcs/tcs85.html#Wegener91
https://www.sciencedirect.com/science/article/abs/pii/0304397591900524
https://www.sciencedirect.com/science/article/pii/0304397591900524
https://core.ac.uk/display/82172673