A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926): Difference between revisions

@@ Property / DOI @@
-.1007/s10817-022-09616-4
@@ Property / DOI: 10.1007/s10817-022-09616-4 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Archive Formal Proofs
@@ Property / describes a project that uses: Archive Formal Proofs / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Locales
@@ Property / describes a project that uses: Locales / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Isabelle/HOL
@@ Property / describes a project that uses: Isabelle/HOL / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Transfer
@@ Property / describes a project that uses: Transfer / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Edmonds-Karp
@@ Property / describes a project that uses: Edmonds-Karp / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Probabilistic_While
@@ Property / describes a project that uses: Probabilistic_While / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Lifting
@@ Property / describes a project that uses: Lifting / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MFMC_Countable
@@ Property / describes a project that uses: MFMC_Countable / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Zoo Probabilistic Systems
@@ Property / describes a project that uses: Zoo Probabilistic Systems / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10817-022-09616-4
+Normal rank
@@ Property / OpenAlex ID @@
+W4206367340
@@ Property / OpenAlex ID: W4206367340 / rank @@
+Normal rank
@@ Property / cites work @@
+Menger's theorem for graphs containing no infinite paths
+Normal rank
@@ Property / cites work @@
+Menger's theorem for infinite graphs
@@ Property / cites work: Menger's theorem for infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Max-Flow Min-Cut theorem for countable networks
+Normal rank
@@ Property / cites work @@
+Proofs of randomized algorithms in Coq
@@ Property / cites work: Proofs of randomized algorithms in Coq / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding bisimilarity and similarity for probabilistic processes.
+Normal rank
@@ Property / cites work @@
+Types for Proofs and Programs
@@ Property / cites work: Types for Proofs and Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Locales: a module system for mathematical theories
+Normal rank
@@ Property / cites work @@
+Exploring the structure of an algebra text with locales
+Normal rank
@@ Property / cites work @@
+Q5111434
@@ Property / cites work: Q5111434 / rank @@
+Normal rank
@@ Property / cites work @@
+Formal certification of code-based cryptographic proofs
+Normal rank
@@ Property / cites work @@
+Truly Modular (Co)datatypes for Isabelle/HOL
@@ Property / cites work: Truly Modular (Co)datatypes for Isabelle/HOL / rank @@
+Normal rank
@@ Property / cites work @@
+Sur le théorème de Zorn
@@ Property / cites work: Sur le théorème de Zorn / rank @@
+Normal rank
@@ Property / cites work @@
+Semantics of Probabilistic Processes
@@ Property / cites work: Semantics of Probabilistic Processes / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+A Formalized Hierarchy of Probabilistic System Types
+Normal rank
@@ Property / cites work @@
+Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
+Normal rank
@@ Property / cites work @@
+Funktionen auf Produkträumen mit vorgegebenen Marginal-Funktionen
+Normal rank
@@ Property / cites work @@
+From types to sets by local type definition in higher-order logic
+Normal rank
@@ Property / cites work @@
+Formalizing the Edmonds-Karp Algorithm
@@ Property / cites work: Formalizing the Edmonds-Karp Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
+Normal rank
@@ Property / cites work @@
+A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks
+Normal rank
@@ Property / cites work @@
+Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
+Normal rank
@@ Property / cites work @@
+Probability on Trees and Networks
@@ Property / cites work: Probability on Trees and Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247084
@@ Property / cites work: Q4247084 / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks in Dirichlet environment: an overview. Dedicated to Dominique Bakry on the occasion of his 60th birthday
+Normal rank
@@ Property / cites work @@
+A General Framework for Probabilistic Characterizing Formulae
+Normal rank
@@ Property / cites work @@
+Transfinite Constructions in Classical Type Theory
+Normal rank
@@ Property / cites work @@
+The Existence of Probability Measures with Given Marginals
+Normal rank
@@ Property / DOI @@
+.1007/S10817-022-09616-4
@@ Property / DOI: 10.1007/S10817-022-09616-4 / rank @@
+Normal rank