The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Frederic Green: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:260-269 [Conf]
  2. Frederic Green
    The Correlation Between Parity and Quadratic Polynomials Mod 3. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:65-72 [Conf]
  3. Frederic Green
    An Oracle Separating +P From PPph. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:295-298 [Conf]
  4. Frederic Green, Steven Homer, Chris Pollett
    On the Complexity of Quantum ACC. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:250-262 [Conf]
  5. Frederic Green, Johannes Köbler, Jacobo Torán
    The Power of the Middle Bit. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:111-117 [Conf]
  6. Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
    Bounds on the Power of Constant-Depth Quantum Circuits. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:44-55 [Conf]
  7. Frederic Green
    Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:71-82 [Conf]
  8. Frederic Green
    A complex-number Fourier technique for lower bounds on the Mod-m degree. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:16-38 [Journal]
  9. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  10. Frederic Green
    Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:27, pp:- [Journal]
  11. Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim
    Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:3, pp:- [Journal]
  12. Frederic Green
    An Oracle Separating \oplus P from PP^PH. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:3, pp:149-153 [Journal]
  13. Frederic Green, Randall Pruim
    Relativized separation of EQP from PNP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:5, pp:257-260 [Journal]
  14. Frederic Green
    The correlation between parity and quadratic polynomials mod 3. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:1, pp:28-44 [Journal]
  15. Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
    The Power of the Middle Bit of a #P Function. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:456-467 [Journal]
  16. Jin-yi Cai, Frederic Green, Thomas Thierauf
    On the Correlation of Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:3, pp:245-258 [Journal]
  17. Frederic Green
    On the Power of Deterministic Reductions to C=P. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:2, pp:215-233 [Journal]
  18. Frederic Green
    A Lower Bound for Monotone Perceptrons. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:4, pp:283-298 [Journal]
  19. Frederic Green
    Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:4, pp:453-466 [Journal]

  20. Efficient Universal Quantum Circuits. [Citation Graph (, )][DBLP]


  21. Uniqueness of Optimal Mod 3 Circuits for Parity. [Citation Graph (, )][DBLP]


  22. Universal Quantum Circuits [Citation Graph (, )][DBLP]


  23. Universal Quantum Circuits. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002