Now showing items 1-2 of 2
Lower bounds for natural functions in restricted boolean circuits
(Georgia Institute of Technology, 1995)
Computing with Polynomials over Composites
(Georgia Institute of Technology, 2006-07-07)
In the last twenty years, algebraic techniques have been applied with great success to several areas in theoretical computer science. However, for many problems involving modular counting, there is a huge gap in our ...