Author:
Miller Douglas,Scrivener Adam,Stern Jesse,Venkitasubramaniam Muthuramakrishnan
Publisher
Springer International Publishing
Reference17 articles.
1. Amano, K., Maruoka, A.: A superpolynomial lower bound for a circuit computing the clique function with at most (1/6) log log n negation gates. SIAM J. Comput. 35(1), 201–216 (2005)
2. Beals, R., Nishino, T., Tanaka, K.: More on the complexity of negation-limited circuits. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, Las Vegas, Nevada, USA, 29 May–1 June 1995, pp. 585–595 (1995)
3. Beals, R., Nishino, T., Tanaka, K.: On the complexity of negation-limited Boolean networks. SIAM J. Comput. 27(5), 1334–1347 (1998)
4. Blais, E., Canonne, C.L., Oliveira, I.C., Servedio, R.A., Tan, L.: Learning circuits with few negations. CoRR abs/1410.8420 (2014)
5. Blum, A., Burch, C., Langford, J.: On learning monotone Boolean functions. In: 39th Annual Symposium on Foundations of Computer Science, FOCS 1998, Palo Alto, California, USA, 8–11 November 1998, pp. 408–415 (1998)