Static Dihedral Rotation Queries (Dihedral Rotation Queries)

From Algorithm Wiki
Revision as of 08:28, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

Determine whether a given dihedral rotation is feasible or not, without modifying the chain.

Related Problems

Related: Dynamic Dihedral Rotation Queries

Parameters

$n$: number of edges in the chain

Table of Algorithms

Currently no algorithms in our database for the given problem.

Reductions FROM Problem

Problem Implication Year Citation Reduction
3SUM' if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$
then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$
2003 https://doi.org/10.1016/S0925-7721(02)00156-6 link

References/Citation

https://doi.org/10.1016/S0925-7721(02)00156-6