Date of Original Version

1991

Type

Technical Report

Rights Management

All Rights Reserved

Abstract or Description

Abstract: "We show that there exists a a [sic] fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs."

Share

COinS