Search Results for author: Oksana Firman

Found 1 papers, 1 papers with code

Computing Height-Optimal Tangles Faster

1 code implementation19 Jan 2019 Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink

We show that this problem is NP-hard, and we give an algorithm that computes an optimal tangle for $n$ wires and a given list $L$ of swaps in $O((2|L|/n^2+1)^{n^2/2} \cdot \varphi^n \cdot n)$ time, where $\varphi \approx 1. 618$ is the golden ratio.

Discrete Mathematics

Cannot find the paper you are looking for? You can Submit a new open access paper.