On the complexity of negation-limited Boolean networks.

Keisuke Tanaka, Tetsuro Nishino

Browse the full STOC paper archive.