MFMC_Countable

swMATH38014MaRDI QIDQ53714FDOQ53714

Author name not available (Why is that?)

Cited In (2)

• CryptHOL: game-based proofs in higher-order logic
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory

This page was built for software: MFMC_Countable