Frederic Greenhttp://aleph0.clarku.edu/~fgreen/home.htmlFrederic GreenThe Book Review Column.6-8202253SIGACT News1https://doi.org/10.1145/3532737.3532739db/journals/sigact/sigact53.html#Green22Frederic GreenThe Book Review Column.3-5202253SIGACT News2https://doi.org/10.1145/3544979.3544981db/journals/sigact/sigact53.html#Green22aFrederic GreenReview of Complexity Dichotomies for Counting Problems Volume 1: Boolean Domain by Jin-Yi Cai and Xi Chen.6-10202253SIGACT News2https://doi.org/10.1145/3544979.3544982db/journals/sigact/sigact53.html#Green22bFrederic GreenThe book review column.3-5202253SIGACT News3https://doi.org/10.1145/3561064.3561065db/journals/sigact/sigact53.html#Green22cFrederic GreenReview 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.".17-20202253SIGACT News3https://doi.org/10.1145/3561064.3561067db/journals/sigact/sigact53.html#Green22dFrederic GreenThe Book Review Column.6202253SIGACT News4https://doi.org/10.1145/3577971.3577973db/journals/sigact/sigact53.html#Green22eFrederic GreenReview of Feasible Computations and Provable Complexity Properties by Juris Hartmanis.7-10202253SIGACT News4https://doi.org/10.1145/3577971.3577974db/journals/sigact/sigact53.html#Green22fFrederic GreenThe Book Review Column.7-8202152SIGACT News1https://doi.org/10.1145/3457588.3457590db/journals/sigact/sigact52.html#Green21Frederic GreenThe Book Review Column.4-6202152SIGACT News2https://doi.org/10.1145/3471469.3471471db/journals/sigact/sigact52.html#Green21aFrederic GreenThe Book Review Column.3-5202152SIGACT News3https://doi.org/10.1145/3494656.3494658db/journals/sigact/sigact52.html#Green21bFrederic GreenReview of Mathematics and Computation by Avi Wigderson.6-10202152SIGACT News3https://doi.org/10.1145/3494656.3494659db/journals/sigact/sigact52.html#Green21cFrederic GreenThe Book Review Column.3-5202152SIGACT News4https://doi.org/10.1145/3510382.3510384db/journals/sigact/sigact52.html#Green21dFrederic GreenReview of Three Lectures on Complexity and Black Holes by Leonard Susskind.6-10202152SIGACT News4https://doi.org/10.1145/3510382.3510385db/journals/sigact/sigact52.html#Green21eAbdulai GassamaFrederic GreenReview of A Short Course in Computational Geometry and Topology by Herbert Edelsbrunner.11-14202152SIGACT News4https://doi.org/10.1145/3510382.3510386db/journals/sigact/sigact52.html#GassamaG21Frederic GreenThe Book Review Column.7-8202051SIGACT News1https://doi.org/10.1145/3388392.3388394db/journals/sigact/sigact51.html#Green20Frederic GreenThe Book Review Column.4-5202051SIGACT News2https://doi.org/10.1145/3406678.3406680db/journals/sigact/sigact51.html#Green20aFrederic GreenThe Book Review Column.5-6202051SIGACT News3https://doi.org/10.1145/3427361.3427363db/journals/sigact/sigact51.html#Green20bFrederic GreenThe Book Review Column1.4-5202051SIGACT News4https://doi.org/10.1145/3444815.3444817db/journals/sigact/sigact51.html#Green20cFrederic GreenReview of Forbidden Configurations in Discrete Geometry by David Eppstein.15-17202051SIGACT News4https://doi.org/10.1145/3444815.3444820db/journals/sigact/sigact51.html#Green20dFrederic GreenThe Book Review Column.7-8201950SIGACT News1https://doi.org/10.1145/3319627.3319629db/journals/sigact/sigact50.html#Green19Frederic GreenReview of Number Theory: An Introduction via the Density of Primes, second edition.9-13201950SIGACT News1https://doi.org/10.1145/3319627.3319630db/journals/sigact/sigact50.html#Green19aFrederic GreenThe Book Review Column.4-5201950SIGACT News2https://doi.org/10.1145/3351452.3351454db/journals/sigact/sigact50.html#Green19bFrederic GreenReview of Modern Cryptography and Elliptic Curves, A Beginner's Guide by Thomas R. Shemanske.12-14201950SIGACT News2https://doi.org/10.1145/3351452.3351457db/journals/sigact/sigact50.html#Green19cFrederic GreenThe Book Review Column.4-5201950SIGACT News3https://doi.org/10.1145/3364626.3364628db/journals/sigact/sigact50.html#Green19dFrederic GreenReview of Handbook of Graph Theory, Combinatorial Optimization, and Algorithms.6-11201950SIGACT News3https://doi.org/10.1145/3364626.3364629db/journals/sigact/sigact50.html#Green19eFrederic GreenThe Book Review Column.4-6201950SIGACT News4https://doi.org/10.1145/3374857.3374859db/journals/sigact/sigact50.html#Green19fFrederic GreenThe Book Review Column.9-11201849SIGACT News1https://doi.org/10.1145/3197406.3197408db/journals/sigact/sigact49.html#Green18Frederic GreenJoint Review of Quadratic Residues and Non-Residues by Steve Wright and The Quadratic Reciprocity Law by Oswald Baumgart Edited and translated by Franz Lemmermeyer.20-28201849SIGACT News1https://doi.org/10.1145/3197406.3197411db/journals/sigact/sigact49.html#Green18aFrederic GreenThe Book Review Column.4-6201849SIGACT News2https://doi.org/10.1145/3232679.3232681db/journals/sigact/sigact49.html#Green18bFrederic GreenThe Book Review Column.6-8201849SIGACT News3https://doi.org/10.1145/3289137.3289139db/journals/sigact/sigact49.html#Green18cStephen A. FennerFrederic GreenSteven HomerFixed-Parameter Extrapolation and Aperiodic Order: Open Problems.35-47201849SIGACT News3https://doi.org/10.1145/3289137.3289145db/journals/sigact/sigact49.html#FennerGH18Frederic GreenThe Book Review Column.4-6201849SIGACT News4https://doi.org/10.1145/3300150.3300152db/journals/sigact/sigact49.html#Green18dFrederic GreenDaniel KreymerEmanuele ViolaBlock-symmetric polynomials correlate with parity better than symmetric.323-364201726Comput. Complex.2https://doi.org/10.1007/s00037-017-0153-3db/journals/cc/cc26.html#GreenKV17Frederic GreenThe Book Review Column.8-9201748SIGACT News1https://doi.org/10.1145/3061640.3061642db/journals/sigact/sigact48.html#Green17Frederic GreenReview of Art in the Life of Mathematicians by Anna Kepes Szemerédi.10-17201748SIGACT News1https://doi.org/10.1145/3061640.3061643db/journals/sigact/sigact48.html#Green17aFrederic GreenThe Book Review Column.4-6201748SIGACT News2https://doi.org/10.1145/3106700.3106702db/journals/sigact/sigact48.html#Green17bFrederic GreenReview of Quantum Walks and Search Algorithms by Renato Portugal.12-15201748SIGACT News2https://doi.org/10.1145/3106700.3106704db/journals/sigact/sigact48.html#Green17cFrederic GreenJoint Review of The Magic of Math by Arthur Benjamin and How to Bake by Eugenia Cheng.16-20201748SIGACT News2https://doi.org/10.1145/3106700.3106705db/journals/sigact/sigact48.html#Green17dFrederic GreenThe Book Review Column.4-6201748SIGACT News3https://doi.org/10.1145/3138860.3138862db/journals/sigact/sigact48.html#Green17eFrederic GreenReview of Set Theory: A First Course by Daniel W. Cunningham.7-9201748SIGACT News3https://doi.org/10.1145/3138860.3138863db/journals/sigact/sigact48.html#Green17fFrederic GreenThe Book Review Column.4-6201748SIGACT News4https://doi.org/10.1145/3173127.3173129db/journals/sigact/sigact48.html#Green17gArkadev ChattopadhyayFrederic GreenHoward StraubingCircuit Complexity of Powering in Fields of Odd Characteristic.20162016Chic. J. Theor. Comput. Sci.http://cjtcs.cs.uchicago.edu/articles/2016/10/contents.htmldb/journals/cjtcs/cjtcs2016.html#ChattopadhyayGS16Frederic GreenThe Book Review Column.4-5201647SIGACT News1https://doi.org/10.1145/2902945.2902947db/journals/sigact/sigact47.html#Green16Frederic GreenReview of: The Nature of Computation by Cristopher Moore and Stephan Mertens.9-11201647SIGACT News1https://doi.org/10.1145/2902945.2902949db/journals/sigact/sigact47.html#Green16aFrederic GreenThe Book Review Column.4-5201647SIGACT News2https://doi.org/10.1145/2951860.2951862db/journals/sigact/sigact47.html#Green16bFrederic GreenReview of: Primality Testing for Beginners by Lasse Rempe-Gillen and Rebecca Waldecker.6-9201647SIGACT News2https://doi.org/10.1145/2951860.2951863db/journals/sigact/sigact47.html#Green16cFrederic GreenThe Book Review Column.5-6201647SIGACT News3https://doi.org/10.1145/2993749.2993751db/journals/sigact/sigact47.html#Green16dFrederic GreenReview of: Quantum Algorithms via Linear Algebra by Richard J. Lipton and Kenneth W. Regan.7-11201647SIGACT News3https://doi.org/10.1145/2993749.2993752db/journals/sigact/sigact47.html#Green16eFrederic GreenThe Book Review Column.4-5201647SIGACT News4https://doi.org/10.1145/3023855.3023857db/journals/sigact/sigact47.html#Green16fFrederic GreenReview of: The Fascinating World of Graph Theory by Arthur Benjamin, Gary Chartrand and Ping Zhang.18-21201647SIGACT News4https://doi.org/10.1145/3023855.3023862db/journals/sigact/sigact47.html#Green16gFrederic GreenThe Book Review Column.10-12201546SIGACT News2https://doi.org/10.1145/2789149.2789151db/journals/sigact/sigact46.html#Green15Frederic GreenThe Book Review Column.5-6201546SIGACT News3https://doi.org/10.1145/2818936.2818938db/journals/sigact/sigact46.html#Green15aFrederic GreenThe Book Review Column.4-5201546SIGACT News4https://doi.org/10.1145/2852040.2852042db/journals/sigact/sigact46.html#Green15bFrederic GreenReview of: Incredible Numbers by Ian Stewart.6-8201546SIGACT News4https://doi.org/10.1145/2852040.2852043db/journals/sigact/sigact46.html#Green15cFrederic GreenReview quantum computing since democritus by Scott Aaronson.42-47201344SIGACT News4https://doi.org/10.1145/2556663.2556673db/journals/sigact/sigact44.html#Green13Frederic GreenDaniel KreymerEmanuele ViolaBlock-symmetric polynomials correlate with parity better than symmetric.TR12-1602012TR12Electron. Colloquium Comput. Complex.https://eccc.weizmann.ac.il/report/2012/160db/journals/eccc/eccc19.html#GreenKV12Frederic GreenDaniel KreymerEmanuele ViolaIn Brute-Force Search of Correlation Bounds for Polynomials.TR11-0392011TR11Electron. Colloquium Comput. Complex.https://eccc.weizmann.ac.il/report/2011/039db/journals/eccc/eccc18.html#GreenKV11Debajyoti BeraStephen A. FennerFrederic GreenSteven HomerEfficient universal quantum circuits.16-27201010Quantum Inf. Comput.1&2https://doi.org/10.26421/QIC10.1-2-2db/journals/qic/qic10.html#BeraFGH10Debajyoti BeraStephen A. FennerFrederic GreenSteven HomerEfficient Universal Quantum Circuits.418-4282009COCOONhttps://doi.org/10.1007/978-3-642-02882-3_42conf/cocoon/2009db/conf/cocoon/cocoon2009.html#BeraFGH09Debajyoti BeraStephen A. FennerFrederic GreenSteven HomerUniversal Quantum Circuitshttp://arxiv.org/abs/0804.24292008CoRRabs/0804.2429db/journals/corr/corr0804.html#abs-0804-2429Debajyoti BeraStephen A. FennerFrederic GreenSteven HomerUniversal Quantum Circuits.2008TR08Electron. Colloquium Comput. Complex.https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-078/index.htmlTR08-078db/journals/eccc/eccc15.html#BeraFGH08Debajyoti BeraFrederic GreenSteven HomerSmall depth quantum circuits.35-50200738SIGACT News2https://doi.org/10.1145/1272729.1272739db/journals/sigact/sigact38.html#BeraGH07Frederic GreenReview of "Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky, " World Scientific.25-30200738SIGACT News4https://doi.org/10.1145/1345189.1345194db/journals/sigact/sigact38.html#Green07Frederic GreenAmitabha Roy 0001Uniqueness of Optimal Mod 3 Circuits for Parity.2007Algebraic Methods in Computational Complexityhttp://drops.dagstuhl.de/opus/volltexte/2008/1305conf/dagstuhl/2007P7411db/conf/dagstuhl/P7411.html#GreenR07M. FangStephen A. FennerFrederic GreenSteven HomerYong Zhang 0053Quantum lower bounds for fanout.46-5720066Quantum Inf. Comput.1https://doi.org/10.26421/QIC6.1-3http://portal.acm.org/citation.cfm?id=2011682db/journals/qic/qic6.html#FangFGHZ06Stephen A. FennerFrederic GreenSteven HomerYong Zhang 0053Bounds on the Power of Constant-Depth Quantum Circuits.44-552005conf/fct/2005FCThttps://doi.org/10.1007/11537311_5db/conf/fct/fct2005.html#FennerGHZ05Frederic GreenThe correlation between parity and quadratic polynomials mod 3.28-44200469J. Comput. Syst. Sci.1https://doi.org/10.1016/j.jcss.2004.01.003db/journals/jcss/jcss69.html#Green04Frederic GreenSteven HomerCristopher MooreChristopher PollettCounting, fanout and the complexity of quantum ACC.35-6520022Quantum Inf. Comput.1https://doi.org/10.26421/QIC2.1-3http://portal.acm.org/citation.cfm?id=2011420db/journals/qic/qic2.html#GreenHMP02Frederic GreenThe Correlation Between Parity and Quadratic Polynomials Mod 3.65-722002conf/coco/2002CCChttps://doi.org/10.1109/CCC.2002.1004341https://doi.ieeecomputersociety.org/10.1109/CCC.2002.1004341db/conf/coco/coco2002.html#Green02Frederic GreenRandall PruimRelativized separation of EQP from PNP.257-260200180Inf. Process. Lett.5db/journals/ipl/ipl80.html#GreenP01https://doi.org/10.1016/S0020-0190(01)00176-4Frederic GreenA complex-number Fourier technique for lower bounds on the Mod-m degree.16-3820009Comput. Complex.1https://doi.org/10.1007/PL00001599db/journals/cc/cc9.html#Green00Frederic GreenSteven HomerChris PollettOn the Complexity of Quantum ACC.250-2622000conf/coco/2000CCChttps://doi.org/10.1109/CCC.2000.856756https://doi.ieeecomputersociety.org/10.1109/CCC.2000.856756db/conf/coco/coco2000.html#GreenHP00Stephen A. FennerFrederic GreenSteven HomerAlan L. SelmanThomas ThieraufHeribert VollmerComplements of Multivalued Functions.19991999Chic. J. Theor. Comput. Sci.http://cjtcs.cs.uchicago.edu/articles/1999/3/contents.htmldb/journals/cjtcs/cjtcs1999.html#FennerGHSTV99Frederic GreenExponential Sums and Circuits with a Single Threshold Gate and Mod-Gates.453-466199932Theory Comput. Syst.4https://doi.org/10.1007/s002240000126db/journals/mst/mst32.html#Green99Stephen A. FennerFrederic GreenSteven HomerRandall PruimDetermining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial HierarchyElectron. Colloquium Comput. Complex.1999TR99-003TR99db/journals/eccc/eccc6.html#ECCC-TR99-003https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-003/index.htmlJin-yi CaiFrederic GreenThomas ThieraufOn the Correlation of Symmetric Functions.245-258199629Math. Syst. Theory3db/journals/mst/mst29.html#CaiGT96https://doi.org/10.1007/BF01201278Stephen A. FennerFrederic GreenSteven HomerAlan L. SelmanThomas ThieraufHeribert VollmerComplements of Multivalued Functions.260-269https://doi.org/10.1109/CCC.1996.507688https://doi.ieeecomputersociety.org/10.1109/CCC.1996.5076881996conf/coco/1996CCCdb/conf/coco/coco96.html#FennerGHSTV96Frederic GreenJohannes KöblerKenneth W. ReganThomas SchwentickJacobo ToránThe Power of the Middle Bit of a #P Function.456-467199550J. Comput. Syst. Sci.3db/journals/jcss/jcss50.html#GreenKRT95https://doi.org/10.1006/jcss.1995.1036Frederic GreenA Lower Bound for Monotone Perceptrons.283-2981995284Math. Syst. Theorydb/journals/mst/mst28.html#Green95https://doi.org/10.1007/BF01185398Frederic GreenLower Bounds for Depth-Three Circuits With Equals and Mod-Gates.71-821995conf/stacs/1995STACSdb/conf/stacs/stacs95.html#Green95https://doi.org/10.1007/3-540-59042-0_63Frederic GreenLower Bounds for Circuits with Mod Gates and One Exact Threshold GateElectron. Colloquium Comput. Complex.1995TR95-027TR95db/journals/eccc/eccc2.html#ECCC-TR95-027https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-027/index.htmlFrederic GreenOn the Power of Deterministic Reductions to C=P.215-233199326Math. Syst. Theory2db/journals/mst/mst26.html#Green93https://doi.org/10.1007/BF01202284Frederic GreenJohannes KöblerJacobo ToránThe Power of the Middle Bit.111-1171992conf/coco/1992SCTdb/conf/coco/coco92.html#GreenKT92https://doi.org/10.1109/SCT.1992.215386https://doi.ieeecomputersociety.org/10.1109/SCT.1992.215386Frederic GreenAn Oracle Separating \oplus P from PP^PH.149-153199137Inf. Process. Lett.3db/journals/ipl/ipl37.html#Green91https://doi.org/10.1016/0020-0190(91)90035-GFrederic GreenAn Oracle Separating +P From PPph.295-2981990conf/coco/1990SCTdb/conf/coco/coco90.html#Green90https://doi.org/10.1109/SCT.1990.113977https://doi.ieeecomputersociety.org/10.1109/SCT.1990.113977Frederic GreenNP-Complete Problems in Cellular Automata.19871Complex Syst.3http://www.complex-systems.com/abstracts/v01_i03_a04.htmldb/journals/compsys/compsys1.html#Green87Debajyoti BeraJin-Yi CaiJin-yi CaiArkadev ChattopadhyayM. FangStephen A. FennerAbdulai GassamaSteven HomerJohannes KöblerDaniel KreymerCristopher MooreChris PollettChristopher PollettRandall PruimKenneth W. ReganAmitabha Roy 0001Thomas SchwentickAlan L. SelmanHoward StraubingThomas ThieraufJacobo ToránEmanuele ViolaHeribert VollmerYong Zhang 0053