On the Complexity of Closest Pair via Polar-Pair of Point-Sets
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..
[2] Jon Louis Bentley,et al. Multidimensional divide-and-conquer , 1980, CACM.
[3] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[4] Sunil Arya,et al. A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees , 2016, SODA.
[5] Ryan Williams,et al. Probabilistic Polynomials and Hamming Nearest Neighbors , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[6] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[7] Dániel Marx,et al. Lower bounds based on the Exponential Time Hypothesis , 2011, Bull. EATCS.
[8] Jon M. Kleinberg,et al. Two algorithms for nearest-neighbor search in high dimensions , 1997, STOC '97.
[9] Ryan Williams,et al. A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..
[10] Ryan Williams,et al. Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made , 2015, STOC.
[11] Ryan Williams,et al. On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity , 2017, SODA.
[12] Peter Frankl,et al. On the contact dimensions of graphs , 1988, Discret. Comput. Geom..
[13] A. Paz. Probabilistic algorithms , 2003 .
[14] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[15] Marvin Künnemann,et al. Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[16] Alexander Schrijver,et al. Equilateral Dimension of the Rectilinear Space , 2000, Des. Codes Cryptogr..
[17] Russell Impagliazzo,et al. The Complexity of Satisfiability of Small Depth Circuits , 2009, IWPEC.
[18] Michael Ian Shamos,et al. Divide-and-conquer in multidimensional space , 1976, STOC '76.
[19] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[20] Mark H. Overmars,et al. Preprocessing chains for fast dihedral rotations is hard or even impossible , 2002, Comput. Geom..
[21] Aviad Rubinstein,et al. Hardness of approximate nearest neighbor search , 2018, STOC.
[22] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[23] Ran Raz,et al. Improved Average-Case Lower Bounds for DeMorgan Formula Size , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[24] Hans-Jürgen Bandelt,et al. Embedding into Rectilinear Spaces , 1998, Discret. Comput. Geom..
[25] Hiroshi Maehara,et al. Space graphs and sphericity , 1984, Discret. Appl. Math..
[26] Andrew Chi-Chih Yao. Lower bounds for algebraic computation trees with integer inputs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[27] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.
[28] Michel Deza,et al. A few applications of negative- type inequalities , 1994, Graphs Comb..
[29] Nathan Linial,et al. Monotone maps, sphericity and bounded second eigenvalue , 2005, J. Comb. Theory, Ser. B.
[30] Richard K. Guy,et al. An Olla-Podrida of Open Problems, Often Oddly Posed , 1983 .
[31] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[32] Elwyn R. Berlekamp,et al. Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..
[33] Richard Ryan Williams,et al. Distributed PCP Theorems for Hardness of Approximation in P , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[34] Oren Weimann,et al. Consequences of Faster Alignment of Sequences , 2014, ICALP.
[35] Russell Impagliazzo,et al. Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[36] Piotr Indyk. Dimensionality reduction techniques for proximity problems , 2000, SODA '00.
[37] Klaus H. Hinrichs,et al. Plane-Sweep Solves the Closest Pair Problem Elegantly , 1988, Inf. Process. Lett..
[38] Virginia Vassilevska Williams. Fine-Grained Algorithms and Complexity (Invited Talk) , 2016, STACS.
[39] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[40] Edgar A. Ramos. An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set , 2001, Discret. Comput. Geom..
[41] Samir Khuller,et al. A Simple Randomized Sieve Algorithm for the Closest-Pair Problem , 1995, Inf. Comput..
[42] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[43] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[44] Hiroshi Maehara. Dispersed points and geometric embedding of complete bipartite graphs , 1991, Discret. Comput. Geom..
[45] Klaus Sutner. Probabilistic Algorithms , 2017 .
[46] Hiroshi Maehara. Contact patterns of equal nonoverlapping spheres , 1985, Graphs Comb..
[47] Karl Bringmann,et al. Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[48] Huacheng Yu,et al. More Applications of the Polynomial Method to Algorithm Design , 2015, SODA.
[49] Virginia Vassilevska Williams,et al. Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) , 2015, IPEC.
[50] Moshe Lewenstein,et al. Closest Pair Problems in Very High Dimensions , 2004, ICALP.
[51] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.