暂无分享,去创建一个
[1] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[2] Orit E. Raz,et al. The Elekes–Szabó Theorem in four dimensions , 2016, Israel Journal of Mathematics.
[3] Frank de Zeeuw,et al. Schwartz-Zippel bounds for two-dimensional products , 2015, 1507.08181.
[4] Timothy M. Chan. All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time , 2008, Algorithmica.
[5] Huacheng Yu,et al. Matching Triangles and Basing Hardness on an Extremely Popular Conjecture , 2015, STOC.
[6] A. Seidenberg. Constructions in algebra , 1974 .
[7] Bernard Chazelle,et al. Lower bounds for linear degeneracy testing , 2005, J. ACM.
[8] Andrew Chi-Chih Yao,et al. A Lower Bound to Finding Convex Hulls , 1981, JACM.
[9] James H. Davenport,et al. Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..
[10] Oren Weimann,et al. Consequences of Faster Alignment of Sequences , 2014, ICALP.
[11] György Elekes,et al. How to find groups? (and how to use them in Erdős geometry?) , 2012, Comb..
[12] J. Michael Steele,et al. Lower Bounds for Algebraic Decision Trees , 1982, J. Algorithms.
[13] Michael O. Rabin,et al. Proving Simultaneous Positivity of Linear Forms , 1972, J. Comput. Syst. Sci..
[14] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[15] Mihai Patrascu,et al. Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.
[16] Moshe Lewenstein,et al. On Hardness of Jumbled Indexing , 2014, ICALP.
[17] Russell Impagliazzo,et al. Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility , 2016, Electron. Colloquium Comput. Complex..
[18] Erik D. Demaine,et al. Subquadratic Algorithms for 3SUM , 2005, Algorithmica.
[19] Lajos Rónyai,et al. A Combinatorial Problem on Polynomials and Rational Functions , 2000, J. Comb. Theory, Ser. A.
[20] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[21] Bud Mishra,et al. Computational Real Algebraic Geometry , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[22] Mark H. Overmars,et al. On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..
[23] Orit E. Raz,et al. Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited , 2015, Symposium on Computational Geometry.
[24] Michael L. Fredman,et al. How Good is the Information Theory Bound in Sorting? , 1976, Theor. Comput. Sci..
[25] Micha Sharir,et al. On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.
[26] Allan Grønlund Jørgensen,et al. Threesomes, Degenerates, and Love Triangles , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[27] Marie-Françoise Roy,et al. Computing roadmaps of semi-algebraic sets (extended abstract) , 1996, STOC '96.
[28] Micha Sharir,et al. Improved Bounds for 3SUM, K-SUM, and Linear Degeneracy , 2015, ESA.
[29] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[30] Sariel Har-Peled,et al. Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard , 2001, SODA '99.
[31] Orit E. Raz,et al. Polynomials vanishing on grids: The Elekes-Rónyai problem revisited , 2014, SoCG.
[32] Ari Freund,et al. Improved Subquadratic 3SUM , 2017, Algorithmica.
[33] Jeff Erickson,et al. Lower bounds for linear satisfiability problems , 1995, SODA '95.
[34] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.