Reduction from 3SUM' to Static Dihedral Rotation Queries: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:5510:55, 15 February 2023‎ Admin talk contribs‎ 491 bytes +491‎ Created page with "FROM: 3SUM' TO: Static Dihedral Rotation Queries == Description == == Implications == if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$<br/>then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$ == Year == 2003 == Reference == Michael Soss, Jeff Erickson, Mark Overmars, Preprocessing chains for fast dihedral rotations is hard or even impossible, Computational Geometry, Volume 26, Issue 3, 2003, Pages 235-246 https://doi.org/10.1016/S0925..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_3SUM%27_to_Static_Dihedral_Rotation_Queries"