|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 7 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Frederic Green, Daniel Kreymer, Emanuele Viola |
In Brute-Force Search of Correlation Bounds for Polynomials.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Efficient universal quantum circuits. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Efficient Universal Quantum Circuits. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Universal Quantum Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Universal Quantum Circuits |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green |
Review of "Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky, " World Scientific. |
SIGACT News |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Debajyoti Bera, Frederic Green, Steven Homer |
Small depth quantum circuits. |
SIGACT News |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Amitabha Roy |
Uniqueness of Optimal Mod 3 Circuits for Parity. |
Algebraic Methods in Computational Complexity |
2007 |
DBLP BibTeX RDF |
|
| 1 | M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang |
Quantum lower bounds for fanout. |
Quantum Information & Computation |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang |
Bounds on the Power of Constant-Depth Quantum Circuits. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green |
The correlation between parity and quadratic polynomials mod 3. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett |
Counting, fanout and the complexity of quantum ACC. |
Quantum Information & Computation |
2002 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green |
The Correlation Between Parity and Quadratic Polynomials Mod 3. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Randall Pruim |
Relativized separation of EQP from PNP. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green |
A complex-number Fourier technique for lower bounds on the Mod-m degree. |
Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
modulo functions, lower bounds, Circuit complexity, Fourier methods |
| 1 | Frederic Green, Steven Homer, Chris Pollett |
On the Complexity of Quantum ACC. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green |
Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates. |
Theory Comput. Syst. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Frederic Green, Thomas Thierauf |
On the Correlation of Symmetric Functions. |
Mathematical Systems Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
multivalued functions, NPMV functions, coNPMV, complete functions, query hierarchy, functional analogue, Boolean hierarchy, computational complexity, complexity, multivalued logic, polynomial time hierarchy |
| 1 | Frederic Green |
Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green |
A Lower Bound for Monotone Perceptrons. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green |
Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green |
On the Power of Deterministic Reductions to C=P. |
Mathematical Systems Theory |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Johannes Köbler, Jacobo Torán |
The Power of the Middle Bit. |
Structure in Complexity Theory Conference |
1992 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green |
An Oracle Separating \oplus P from PP^PH. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green |
An Oracle Separating +P From PPph. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")