On the number of solutions of the discretizable molecular distance geometry problem

Details On the number of solutions of the discretizable molecular distance geometry problem On the number of solutions of the discretizable molecular distance geometry problem

2010-10-09

arxiv.org/abs/1010.1834v1

Computer Science

Discrete Mathematics

14 pages, 5 figures

Scientific paper

The Generalized Discretizable Molecular Distance Geometry Problem is a
distance geometry problems that can be solved by a combinatorial algorithm
called ``Branch-and-Prune''. It was observed empirically that the number of
solutions of YES instances is always a power of two. We give a proof that this
event happens with probability one.

Affiliated with

Also associated with

No associations

Rating

On the number of solutions of the discretizable molecular distance geometry problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the number of solutions of the discretizable molecular distance geometry problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the number of solutions of the discretizable molecular distance geometry problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221078