Finding smooth maps is NP-complete

Authors:
Jan Poland
Affiliations:
Eberhard-Karls-Universität Tübingen, Lehrstuhl Rechnerarchitektur, Wilhelm-Schickard-Institut für Informatik, Tübingen 72076, Germany
Venue:
Information Processing Letters
Year:
2003

Citing 2
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Evolutionary Search for Smooth Maps in Motor Control Unit Calibration

SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications

Evolutionary Search for Smooth Maps in Motor Control Unit Calibration

SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the computational complexity of a combinatorial optimization problem that is motivated from motor control unit calibration. In particular we prove its NP-hardness.