More on the complexity of negation-limited circuits - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Robert Beals' in GoogleThis author has not been identified. Look up 'Tetsuro Nishino' in GoogleThis author has not been identified. Look up 'Keisuke Tanaka' in Google

runs on WebDSL