12 citations · 14 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2004★ 2 cited
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy
Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
In this report we study the problem of determining three-dimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central importan…
cs.DS2004
The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization
Taneli Mielikäinen, Esko Ukkonen
The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown -hard by expressing the satisfiability of boolean formulas in 3-conjun…