Author:
Sengupta Rimli,Venkateswaran H.
Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. Monotone versus positive;Ajtai;J. Assoc. Comput. Mach.,1987
2. The monotone circuit complexity of Boolean functions;Alon;Combinatorica,1987
3. C. Àlvarez, B. Jenner, A very hard log space counting class, Proc. 5th IEEE Structures, 1990, pp. 154–168.
4. L. Babai, A. Gal, A. Wigderson, Superpolynomial lower bounds for monotone span programs, DIMACS Tech. Report 96–37, 1996.
5. Two applications of inductive counting for complementation problems;Borodin;SIAM J. Comput.,1989