๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Exponential time improvement for min-wise based algorithms

โœ Scribed by Guy Feigenblat; Ely Porat; Ariel Shiftan

Book ID
113641972
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
284 KB
Volume
209
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An improved exponential-time algorithm f
An improved exponential-time algorithm for k -SAT
โœ Paturi, Ramamohan; Pudlรกk, Pavel; Saks, Michael E.; Zane, Francis ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 222 KB
An improved circuit-partitioning algorit
An improved circuit-partitioning algorithm based on min-cut equivalence relation
โœ Xianyang Jiang; Xubang Shen; Tianxu Zhang; Huayu Liu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

Network flow is an excellent approach to finding min-cuts in network because of the celebrated maxflow/min-cut theorem. For a long time, however, it has not been a practical circuit partitioning method for its relatively high computational complexity. Algorithm FBB is the first one to apply network