Robert Beals, Tetsuro Nishino, Keisuke Tanaka. More on the complexity of negation-limited circuits. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 585-595, ACM, 1995. [doi]
@inproceedings{BealsNT95, title = {More on the complexity of negation-limited circuits}, author = {Robert Beals and Tetsuro Nishino and Keisuke Tanaka}, year = {1995}, doi = {10.1145/225058.225276}, url = {http://doi.acm.org/10.1145/225058.225276}, researchr = {https://researchr.org/publication/BealsNT95}, cites = {0}, citedby = {0}, pages = {585-595}, booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA}, publisher = {ACM}, }