Is the Distance Geometry Problem in NP?

doi 10.1007/978-1-4614-5128-0_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer New York

Related search

Computing the Interleaving Distance Is NP-Hard

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2019English

Grover’s Algorithm Applied to the Molecular Distance Geometry Problem

2016English

The Multivariate Quadratic Power Problem Over Zn Is Np-Complete

Information Technology and Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2012English

The Solution of the Distance Geometry Problem in Protein Modeling via Geometric Buildup

2008English

Special Case of the Single Machine Total Tardiness Problem Is Np-Hard

IFAC Proceedings Volumes
2006English

The Distance Geometry of Music

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2009English

An NP-complete Matching Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1980English

Inductive Complexity of the P Versus Np Problem

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
2013English

Barvinok’s Naive Algorithm in Distance Geometry

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy