Frederic Green

According to our database1, Frederic Green authored at least 52 papers between 1987 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Review of Feasible Computations and Provable Complexity Properties by Juris Hartmanis.
SIGACT News, 2022

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, 2022

Review of Complexity Dichotomies for Counting Problems Volume 1: Boolean Domain by Jin-Yi Cai and Xi Chen.
SIGACT News, 2022

2021
Review of Three Lectures on Complexity and Black Holes by Leonard Susskind.
SIGACT News, 2021

Review of Mathematics and Computation by Avi Wigderson.
SIGACT News, 2021

Review of A Short Course in Computational Geometry and Topology by Herbert Edelsbrunner.
SIGACT News, 2021

2020
Review of Forbidden Configurations in Discrete Geometry by David Eppstein.
SIGACT News, 2020

The Book Review Column1.
SIGACT News, 2020

2019
Review of Handbook of Graph Theory, Combinatorial Optimization, and Algorithms.
SIGACT News, 2019

Review of Modern Cryptography and Elliptic Curves, A Beginner's Guide by Thomas R. Shemanske.
SIGACT News, 2019

Review of Number Theory: An Introduction via the Density of Primes, second edition.
SIGACT News, 2019

2018
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, 2018

Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems.
SIGACT News, 2018

2017
The Book Review Column.
SIGACT News, 2017

Review of Set Theory: A First Course by Daniel W. Cunningham.
SIGACT News, 2017

Joint Review of The Magic of Math by Arthur Benjamin and How to Bake by Eugenia Cheng.
SIGACT News, 2017

Review of Quantum Walks and Search Algorithms by Renato Portugal.
SIGACT News, 2017

Review of Art in the Life of Mathematicians by Anna Kepes Szemerédi.
SIGACT News, 2017

Block-symmetric polynomials correlate with parity better than symmetric.
Comput. Complex., 2017

2016
Review of: The Fascinating World of Graph Theory by Arthur Benjamin, Gary Chartrand and Ping Zhang.
SIGACT News, 2016

Review of: Quantum Algorithms via Linear Algebra by Richard J. Lipton and Kenneth W. Regan.
SIGACT News, 2016

Review of: Primality Testing for Beginners by Lasse Rempe-Gillen and Rebecca Waldecker.
SIGACT News, 2016

Review of: The Nature of Computation by Cristopher Moore and Stephan Mertens.
SIGACT News, 2016

Circuit Complexity of Powering in Fields of Odd Characteristic.
Chic. J. Theor. Comput. Sci., 2016

2015
Review of: Incredible Numbers by Ian Stewart.
SIGACT News, 2015

2013
Review quantum computing since democritus by Scott Aaronson.
SIGACT News, 2013

2011
In Brute-Force Search of Correlation Bounds for Polynomials.
Electron. Colloquium Comput. Complex., 2011

2010
Efficient universal quantum circuits.
Quantum Inf. Comput., 2010

2008
Universal Quantum Circuits.
Electron. Colloquium Comput. Complex., 2008

2007
Review of "Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky, " World Scientific.
SIGACT News, 2007

Small depth quantum circuits.
SIGACT News, 2007

Uniqueness of Optimal Mod 3 Circuits for Parity.
Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007

2006
Quantum lower bounds for fanout.
Quantum Inf. Comput., 2006

2005
Bounds on the Power of Constant-Depth Quantum Circuits.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
The correlation between parity and quadratic polynomials mod 3.
J. Comput. Syst. Sci., 2004

2002
Counting, fanout and the complexity of quantum ACC.
Quantum Inf. Comput., 2002

2001
Relativized separation of EQP from P<sup>NP</sup>.
Inf. Process. Lett., 2001

2000
A complex-number Fourier technique for lower bounds on the Mod-m degree.
Comput. Complex., 2000

On the Complexity of Quantum ACC.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999
Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates.
Theory Comput. Syst., 1999

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
Electron. Colloquium Comput. Complex., 1999

Complements of Multivalued Functions.
Chic. J. Theor. Comput. Sci., 1999

1996
On the Correlation of Symmetric Functions.
Math. Syst. Theory, 1996

1995
A Lower Bound for Monotone Perceptrons.
Math. Syst. Theory, 1995

The Power of the Middle Bit of a #P Function.
J. Comput. Syst. Sci., 1995

Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate
Electron. Colloquium Comput. Complex., 1995

Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates.
Proceedings of the STACS 95, 1995

1993
On the Power of Deterministic Reductions to C=P.
Math. Syst. Theory, 1993

1992
The Power of the Middle Bit.
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991
An Oracle Separating \oplus P from PP^PH.
Inf. Process. Lett., 1991

1990
An Oracle Separating +P From PP<sup>ph</sup>.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1987
NP-Complete Problems in Cellular Automata.
Complex Syst., 1987


  Loading...