With exact rank-value oracles, the number of common integer bases of two equal-rank polymatroids can be approximated by an FPRAS whose oracle calls and non-oracle bit work are polynomial on every run in ground-set size, binary input length, inverse relative error, and log inverse failure probability.
With exact rank-value oracles, the number of common integer bases of two equal-rank polymatroids can be approximated by an FPRAS whose oracle calls and non-oracle bit work are polynomial on every run in ground-set size, binary input length, inverse relative error, and log inverse failure probability.
With exact rank-value oracles, the number of common integer bases of two equal-rank polymatroids can be approximated by an FPRAS whose oracle calls and non-oracle bit work are polynomial on every run in ground-set size, binary input length, inverse relative error, and log inverse failure probability.
If correct, extends randomized approximate counting to common integer polymatroid bases with binary capacities.
Can common integer polymatroid bases be approximately counted in time polynomial in binary capacity length?
Publication dates and editorial changes.
OpenAI reports an FPRAS for common integer polymatroid bases
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
