Random Generation and Approximate Counting of Combinatorial Structures

Details Random Generation and Approximate Counting of Combinatorial Structures Random Generation and Approximate Counting of Combinatorial Structures

2010-12-14

arxiv.org/abs/1012.3000v1

Computer Science

Computational Complexity

Scientific paper

The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some classes of NP relations admitting efficient ranking. On the other hand, there are situations in which efficient random generation is possible even when ranking is computationally infeasible. We introduce the notion of ambiguous description as a tool for random generation and approximate counting in such cases and show, in particular, some applications to the case of formal languages. Finally, we discuss a limit of an heuristic for combinatorial optimization problems based on the random initialization of local search algorithms showing that derandomizing such heuristic can be, in some cases, #P-hard.

Affiliated with

Also associated with

No associations

Rating

Random Generation and Approximate Counting of Combinatorial Structures 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 Random Generation and Approximate Counting of Combinatorial Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Generation and Approximate Counting of Combinatorial Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-179399