Frederic Green

	2011
29		Frederic Green, Daniel Kreymer, Emanuele Viola: In Brute-Force Search of Correlation Bounds for Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 18: 39 (2011)
	2010
28		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Efficient universal quantum circuits. Quantum Information & Computation 10(1&2): 16-27 (2010)
	2009
27		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Efficient Universal Quantum Circuits. COCOON 2009: 418-428
	2008
26		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Universal Quantum Circuits CoRR abs/0804.2429: (2008)
25		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Universal Quantum Circuits. Electronic Colloquium on Computational Complexity (ECCC) 15(078): (2008)
	2007
24		Frederic Green, Amitabha Roy: Uniqueness of Optimal Mod 3 Circuits for Parity. Algebraic Methods in Computational Complexity 2007
23		Debajyoti Bera, Frederic Green, Steven Homer: Small depth quantum circuits. SIGACT News 38(2): 35-50 (2007)
22		Frederic Green: Review of "Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky, " World Scientific. SIGACT News 38(4): 25-30 (2007)
	2006
21		M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang: Quantum lower bounds for fanout. Quantum Information & Computation 6(1): 46-57 (2006)
	2005
20		Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang: Bounds on the Power of Constant-Depth Quantum Circuits. FCT 2005: 44-55
	2004
19		Frederic Green: The correlation between parity and quadratic polynomials mod 3. J. Comput. Syst. Sci. 69(1): 28-44 (2004)
	2002
18		Frederic Green: The Correlation Between Parity and Quadratic Polynomials Mod 3. IEEE Conference on Computational Complexity 2002: 65-72
17		Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett: Counting, fanout and the complexity of quantum ACC. Quantum Information & Computation 2(1): 35-65 (2002)
	2001
16		Frederic Green, Randall Pruim: Relativized separation of EQP from PNP. Inf. Process. Lett. 80(5): 257-260 (2001)
	2000
15		Frederic Green, Steven Homer, Chris Pollett: On the Complexity of Quantum ACC. IEEE Conference on Computational Complexity 2000: 250-262
14		Frederic Green: A complex-number Fourier technique for lower bounds on the Mod-m degree. Computational Complexity 9(1): 16-38 (2000)
	1999
13		Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer: Complements of Multivalued Functions. Chicago J. Theor. Comput. Sci. 1999: (1999)
12		Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim: Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 6(3): (1999)
11		Frederic Green: Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates. Theory Comput. Syst. 32(4): 453-466 (1999)
	1996
10		Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer: Complements of Multivalued Functions. IEEE Conference on Computational Complexity 1996: 260-269
9		Jin-yi Cai, Frederic Green, Thomas Thierauf: On the Correlation of Symmetric Functions. Mathematical Systems Theory 29(3): 245-258 (1996)
	1995
8		Frederic Green: Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates. STACS 1995: 71-82
7		Frederic Green: Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate Electronic Colloquium on Computational Complexity (ECCC) 2(27): (1995)
6		Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán: The Power of the Middle Bit of a #P Function. J. Comput. Syst. Sci. 50(3): 456-467 (1995)
5		Frederic Green: A Lower Bound for Monotone Perceptrons. Mathematical Systems Theory 28(4): 283-298 (1995)
	1993
4		Frederic Green: On the Power of Deterministic Reductions to C=P. Mathematical Systems Theory 26(2): 215-233 (1993)
	1992
3		Frederic Green, Johannes Köbler, Jacobo Torán: The Power of the Middle Bit. Structure in Complexity Theory Conference 1992: 111-117
	1991
2		Frederic Green: An Oracle Separating \oplus P from PP^PH. Inf. Process. Lett. 37(3): 149-153 (1991)
	1990
1		Frederic Green: An Oracle Separating +P From PPph. Structure in Complexity Theory Conference 1990: 295-298

Coauthor Index

1	Debajyoti Bera	[23] [25] [26] [27] [28]
2	Jin-Yi Cai (Jin-yi Cai)	[9]
3	M. Fang	[21]
4	Stephen A. Fenner	[10] [12] [13] [20] [21] [25] [26] [27] [28]
5	Steven Homer	[10] [12] [13] [15] [17] [20] [21] [23] [25] [26] [27] [28]
6	Johannes Köbler	[3] [6]
7	Daniel Kreymer	[29]
8	Cristopher Moore	[17]
9	Chris Pollett (Christopher Pollett)	[15] [17]
10	Randall Pruim	[12] [16]
11	Kenneth W. Regan	[6]
12	Amitabha Roy	[24]
13	Thomas Schwentick	[6]
14	Alan L. Selman	[10] [13]
15	Thomas Thierauf	[9] [10] [13]
16	Jacobo Torán	[3] [6]
17	Emanuele Viola	[29]
18	Heribert Vollmer	[10] [13]
19	Yong Zhang	[20] [21]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page