default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrederic Green
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j71]Frederic Green:
The Book Review Column. SIGACT News 53(1): 6-8 (2022)- [j70]Frederic Green:
The Book Review Column. SIGACT News 53(2): 3-5 (2022) - [j69]Frederic Green:
Review of Complexity Dichotomies for Counting Problems Volume 1: Boolean Domain by Jin-Yi Cai and Xi Chen. SIGACT News 53(2): 6-10 (2022) - [j68]Frederic Green:
The book review column. SIGACT News 53(3): 3-5 (2022) - [j67]Frederic Green:
Review of "Mathematical Muffin Morsels - Nobody wants a small piece by William Gasarch, Erik Metz, Jacob Prinz, and Daniel Smolyak World Scientific, 2021 210 pages, Softcover, $59.99.". SIGACT News 53(3): 17-20 (2022) - [j66]Frederic Green:
The Book Review Column. SIGACT News 53(4): 6 (2022) - [j65]Frederic Green:
Review of Feasible Computations and Provable Complexity Properties by Juris Hartmanis. SIGACT News 53(4): 7-10 (2022) - 2021
- [j64]Frederic Green:
The Book Review Column. SIGACT News 52(1): 7-8 (2021) - [j63]Frederic Green:
The Book Review Column. SIGACT News 52(2): 4-6 (2021) - [j62]Frederic Green:
The Book Review Column. SIGACT News 52(3): 3-5 (2021) - [j61]Frederic Green:
Review of Mathematics and Computation by Avi Wigderson. SIGACT News 52(3): 6-10 (2021) - [j60]Frederic Green:
The Book Review Column. SIGACT News 52(4): 3-5 (2021) - [j59]Frederic Green:
Review of Three Lectures on Complexity and Black Holes by Leonard Susskind. SIGACT News 52(4): 6-10 (2021) - [j58]Abdulai Gassama, Frederic Green:
Review of A Short Course in Computational Geometry and Topology by Herbert Edelsbrunner. SIGACT News 52(4): 11-14 (2021) - 2020
- [j57]Frederic Green:
The Book Review Column. SIGACT News 51(1): 7-8 (2020) - [j56]Frederic Green:
The Book Review Column. SIGACT News 51(2): 4-5 (2020) - [j55]Frederic Green:
The Book Review Column. SIGACT News 51(3): 5-6 (2020) - [j54]Frederic Green:
The Book Review Column1. SIGACT News 51(4): 4-5 (2020) - [j53]Frederic Green:
Review of Forbidden Configurations in Discrete Geometry by David Eppstein. SIGACT News 51(4): 15-17 (2020)
2010 – 2019
- 2019
- [j52]Frederic Green:
The Book Review Column. SIGACT News 50(1): 7-8 (2019) - [j51]Frederic Green:
Review of Number Theory: An Introduction via the Density of Primes, second edition. SIGACT News 50(1): 9-13 (2019) - [j50]Frederic Green:
The Book Review Column. SIGACT News 50(2): 4-5 (2019) - [j49]Frederic Green:
Review of Modern Cryptography and Elliptic Curves, A Beginner's Guide by Thomas R. Shemanske. SIGACT News 50(2): 12-14 (2019) - [j48]Frederic Green:
The Book Review Column. SIGACT News 50(3): 4-5 (2019) - [j47]Frederic Green:
Review of Handbook of Graph Theory, Combinatorial Optimization, and Algorithms. SIGACT News 50(3): 6-11 (2019) - [j46]Frederic Green:
The Book Review Column. SIGACT News 50(4): 4-6 (2019) - 2018
- [j45]Frederic Green:
The Book Review Column. SIGACT News 49(1): 9-11 (2018) - [j44]Frederic Green:
Joint Review of Quadratic Residues and Non-Residues by Steve Wright and The Quadratic Reciprocity Law by Oswald Baumgart Edited and translated by Franz Lemmermeyer. SIGACT News 49(1): 20-28 (2018) - [j43]Frederic Green:
The Book Review Column. SIGACT News 49(2): 4-6 (2018) - [j42]Frederic Green:
The Book Review Column. SIGACT News 49(3): 6-8 (2018) - [j41]Stephen A. Fenner, Frederic Green, Steven Homer:
Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. SIGACT News 49(3): 35-47 (2018) - [j40]Frederic Green:
The Book Review Column. SIGACT News 49(4): 4-6 (2018) - 2017
- [j39]Frederic Green, Daniel Kreymer, Emanuele Viola:
Block-symmetric polynomials correlate with parity better than symmetric. Comput. Complex. 26(2): 323-364 (2017) - [j38]Frederic Green:
The Book Review Column. SIGACT News 48(1): 8-9 (2017) - [j37]Frederic Green:
Review of Art in the Life of Mathematicians by Anna Kepes Szemerédi. SIGACT News 48(1): 10-17 (2017) - [j36]Frederic Green:
The Book Review Column. SIGACT News 48(2): 4-6 (2017) - [j35]Frederic Green:
Review of Quantum Walks and Search Algorithms by Renato Portugal. SIGACT News 48(2): 12-15 (2017) - [j34]Frederic Green:
Joint Review of The Magic of Math by Arthur Benjamin and How to Bake by Eugenia Cheng. SIGACT News 48(2): 16-20 (2017) - [j33]Frederic Green:
The Book Review Column. SIGACT News 48(3): 4-6 (2017) - [j32]Frederic Green:
Review of Set Theory: A First Course by Daniel W. Cunningham. SIGACT News 48(3): 7-9 (2017) - [j31]Frederic Green:
The Book Review Column. SIGACT News 48(4): 4-6 (2017) - 2016
- [j30]Arkadev Chattopadhyay, Frederic Green, Howard Straubing:
Circuit Complexity of Powering in Fields of Odd Characteristic. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j29]Frederic Green:
The Book Review Column. SIGACT News 47(1): 4-5 (2016) - [j28]Frederic Green:
Review of: The Nature of Computation by Cristopher Moore and Stephan Mertens. SIGACT News 47(1): 9-11 (2016) - [j27]Frederic Green:
The Book Review Column. SIGACT News 47(2): 4-5 (2016) - [j26]Frederic Green:
Review of: Primality Testing for Beginners by Lasse Rempe-Gillen and Rebecca Waldecker. SIGACT News 47(2): 6-9 (2016) - [j25]Frederic Green:
The Book Review Column. SIGACT News 47(3): 5-6 (2016) - [j24]Frederic Green:
Review of: Quantum Algorithms via Linear Algebra by Richard J. Lipton and Kenneth W. Regan. SIGACT News 47(3): 7-11 (2016) - [j23]Frederic Green:
The Book Review Column. SIGACT News 47(4): 4-5 (2016) - [j22]Frederic Green:
Review of: The Fascinating World of Graph Theory by Arthur Benjamin, Gary Chartrand and Ping Zhang. SIGACT News 47(4): 18-21 (2016) - 2015
- [j21]Frederic Green:
The Book Review Column. SIGACT News 46(2): 10-12 (2015) - [j20]Frederic Green:
The Book Review Column. SIGACT News 46(3): 5-6 (2015) - [j19]Frederic Green:
The Book Review Column. SIGACT News 46(4): 4-5 (2015) - [j18]Frederic Green:
Review of: Incredible Numbers by Ian Stewart. SIGACT News 46(4): 6-8 (2015) - 2013
- [j17]Frederic Green:
Review quantum computing since democritus by Scott Aaronson. SIGACT News 44(4): 42-47 (2013) - 2012
- [i7]Frederic Green, Daniel Kreymer, Emanuele Viola:
Block-symmetric polynomials correlate with parity better than symmetric. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i6]Frederic Green, Daniel Kreymer, Emanuele Viola:
In Brute-Force Search of Correlation Bounds for Polynomials. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j16]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Efficient universal quantum circuits. Quantum Inf. Comput. 10(1&2): 16-27 (2010)
2000 – 2009
- 2009
- [c8]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Efficient Universal Quantum Circuits. COCOON 2009: 418-428 - 2008
- [i5]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Universal Quantum Circuits. CoRR abs/0804.2429 (2008) - [i4]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Universal Quantum Circuits. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j15]Debajyoti Bera, Frederic Green, Steven Homer:
Small depth quantum circuits. SIGACT News 38(2): 35-50 (2007) - [j14]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) - [i3]Frederic Green, Amitabha Roy:
Uniqueness of Optimal Mod 3 Circuits for Parity. Algebraic Methods in Computational Complexity 2007 - 2006
- [j13]M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang:
Quantum lower bounds for fanout. Quantum Inf. Comput. 6(1): 46-57 (2006) - 2005
- [c7]Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang:
Bounds on the Power of Constant-Depth Quantum Circuits. FCT 2005: 44-55 - 2004
- [j12]Frederic Green:
The correlation between parity and quadratic polynomials mod 3. J. Comput. Syst. Sci. 69(1): 28-44 (2004) - 2002
- [j11]Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett:
Counting, fanout and the complexity of quantum ACC. Quantum Inf. Comput. 2(1): 35-65 (2002) - [c6]Frederic Green:
The Correlation Between Parity and Quadratic Polynomials Mod 3. CCC 2002: 65-72 - 2001
- [j10]Frederic Green, Randall Pruim:
Relativized separation of EQP from PNP. Inf. Process. Lett. 80(5): 257-260 (2001) - 2000
- [j9]Frederic Green:
A complex-number Fourier technique for lower bounds on the Mod-m degree. Comput. Complex. 9(1): 16-38 (2000) - [c5]Frederic Green, Steven Homer, Chris Pollett:
On the Complexity of Quantum ACC. CCC 2000: 250-262
1990 – 1999
- 1999
- [j8]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. 1999 (1999) - [j7]Frederic Green:
Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates. Theory Comput. Syst. 32(4): 453-466 (1999) - [i2]Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim:
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR99 (1999) - 1996
- [j6]Jin-yi Cai, Frederic Green, Thomas Thierauf:
On the Correlation of Symmetric Functions. Math. Syst. Theory 29(3): 245-258 (1996) - [c4]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. CCC 1996: 260-269 - 1995
- [j5]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) - [j4]Frederic Green:
A Lower Bound for Monotone Perceptrons. Math. Syst. Theory 28(4): 283-298 (1995) - [c3]Frederic Green:
Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates. STACS 1995: 71-82 - [i1]Frederic Green:
Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate. Electron. Colloquium Comput. Complex. TR95 (1995) - 1993
- [j3]Frederic Green:
On the Power of Deterministic Reductions to C=P. Math. Syst. Theory 26(2): 215-233 (1993) - 1992
- [c2]Frederic Green, Johannes Köbler, Jacobo Torán:
The Power of the Middle Bit. SCT 1992: 111-117 - 1991
- [j2]Frederic Green:
An Oracle Separating \oplus P from PP^PH. Inf. Process. Lett. 37(3): 149-153 (1991) - 1990
- [c1]Frederic Green:
An Oracle Separating +P From PPph. SCT 1990: 295-298
1980 – 1989
- 1987
- [j1]Frederic Green:
NP-Complete Problems in Cellular Automata. Complex Syst. 1(3) (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
