The Distance Approach to Approximate Combinatorial Counting

Details The Distance Approach to Approximate Combinatorial Counting The Distance Approach to Approximate Combinatorial Counting

2000-05-26

arxiv.org/abs/math/0005263v1

Mathematics

Combinatorics

34 pages

Scientific paper

We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combinatorially defined set via solving some randomly generated optimization problems on the set. Geometrically, we estimate the cardinality of a subset of the Boolean cube via the average distance from a point in the cube to the subset. As an application, we present a new randomized polynomial time algorithm which approximates the permanent of a 0-1 matrix by solving a small number of Assignment problems.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-707145