Mathematics and Computer Science Faculty
 |
Frederic Green, Ph.D.ProfessorDepartment of Mathematics and Computer Science Clark University Worcester, MA 01610-1477 (508) 793-7410 phone email: Personal Web Page: http://cs.clarku.edu/~fgreen/home.html |
| 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 TeachingProfessor Green's research interests include theory of computation, circuit complexity, computational complexity, quantum computation, and theoretical and computational physics.
Selected PublicationsM. Fang, S. Fenner, F. Green, S. Homer, and Y. Zhang, Quantum lower bounds for fanout, arXiv preprint quant-ph/0312208.S. Fenner, F. Green , S. Homer , and Y. Zhang, Bounds on the power of constant-depth quantum circuits, arXiv preprint quant-ph/0312209. F. Green , The Correlation Between Parity and Quadratic Polynomials Mod 3, in 17th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press (2002), pp. 65 -72. Appeared in Journal of Computer and System Sciences 69 (2004) pp. 28 - 44. Postscript, PDF. F. Green , S. Homer , and C. Pollett , On the complexity of quantum ACC, Boston University CS Dept. preprint BUCS-TR-2000-003, and in arXiv.org, report quant-ph/0002057 . In 15th Annual IEEE Conference on Computational Complexity , IEEE Computer Society Press, (2000), pp. 250 - 262. Combined/expanded version with authors F. Green , S. Homer , C. Moore , and C. Pollett , under the title "Counting, fanout and the complexity of quantum ACC," appeared in Quantum Information and Computation 2 (2002), pp. 35 - 65. See arXiv preprint quant-ph/0106017. F. Green and R. Puim, Relativized separation of EQP from P(NP), in Information Processing Letters , 80 (2001) pp. 257 - 260. Postscript , PDF.
|