Professor Green received a B.S. from Renssalaer Polytechnic Institute in 1973, an M.S. from Worcester Polytechnic Institute and a Ph.D. from Yale University in 1986. He has been with Clark since 1986.
Current Research and Teaching
Professor Green's research interests include theory of computation, circuit complexity, computational complexity, quantum computation, and theoretical and computational physics.
F. Green, D. Kreymer, and E. Viola, "Block-Symmetric Polynomials Correlate with Parity Better Than Symmetric," in Electronic Colloquium on Computational Complexity, report 160 (2012); PDF available here.
D. Bera, S. Fenner, F. Green and S. Homer, Universal Quantum Circuits, in arXiv:0804.2429 (2008). Appeared under the title "Efficient Universal Quantum Circuits", in COCOON 2009, pp. 418-428, LNCS 5609 (Springer-Verlag), and in Quantum Information and Computation 10 (2010) 16-27.
F. Green and A. Roy, Uniqueness of optimal mod 3 circuits for parity, in Dagstuhl Seminar Proceedings 07411 "Algebraic Methods in Computational Complexity" (2008). Also available: powerpoint and keynote slides. Updated & corrected version appeared under the title Uniqueness of optimal mod 3 polynomials for parity in Journal of Number Theory 130 (2010), pp. 961 - 975, full text available on-line here. (Okay, you read the paper, you glanced at the slides. Now you can see the movie!)
F. Green, A. Roy, and H. Straubing, Bounds on an exponential sum arising in Boolean circuit complexity, in Comptes Rendus 341(5) (2005), pp. 279-282.
S. Fenner, F. Green, S. Homer, and Y. Zhang, Bounds on the power of constant-depth quantum circuits, arXiv preprint quant-ph/0312209. Appeared in Proceedings of Fundamentals of Computation Theory: 15th International Symposium, Lecture Notes in Computer Science 3623 (2005), pp. 44-55.