-
Notifications
You must be signed in to change notification settings - Fork 4
/
index.html
135 lines (103 loc) · 3.27 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
<html lang="fr">
<head>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
<link href="engine.css" rel="stylesheet">
<script src="lib/viz.js"></script>
<script src="lib/leader-line.min.js"></script>
<script src="lib/p5.min.js"></script>
<script src="js/graphdom.js"></script>
<script src="js/main.js"></script>
<meta charset="UTF-8">
</head>
<body>
<div id="menu">
<h1>Explore mathematical proofs interactively</h1>
<h2>Adding a new proof in the list below</h2>
Do not hesitate to contribute by adding a new proof by making a pull request on the <a target="_blank"
href="https://github.com/francoisschwarzentruber/prooffold">github project</a>.
<h2>Maths</h2>
<ul>
<li>
<a id="sqrt2irrational">\(\sqrt 2\) is irrational</a>
</li>
</ul>
<h2>Probability theory</h2>
<ul>
<li>
<a id="probabilitytheory/weak_law_of_large_numbers">Weak law of large numbers</a>
</li>
</ul>
<h2>Graph Theory</h2>
<ul>
<li>
<a id="konig">König's theorem</a>
</li>
<li>
<a id="hall">Hall's theorem</a>
</li>
<li>
<a id="berge">Berge's lemma</a>
</li>
<li>
<a id="tutte-berge">Tutte and Berge's formula</a>
</li>
</ul>
<h2>Algorithms</h2>
<ul>
<li>
<a id="mastertheorem">Master's theorem</a>
</li>
<li>
<a id="dijkstra">Dijkstra's algorithm</a>
</li>
<li>
<a id="fordfulkerson">Correctness of Ford-Fulkerson</a>
</li>
<li>
<a id="simplex_terminaison">Terminaison of the Simplex Algorithm</a>
</li>
<li>
<a id="2approximation_minvertexcover">2-approximation of minimum vertex cover</a>
</li>
<li>
<a id="christofides">Christofides's algorithm</a>
</li>
<li>
<a id="euclideantsp_approx">Approximation of Euclidean TSP</a>
</li>
<li>
<a id="rrt">RRT</a>
</li>
</ul>
<h2>Complexity theory</h2>
<ul>
<li>
<a id="cook">Cook's theorem</a>
</li>
<li>
<a id="max2sat-np-complete">MAX2SAT is NP-complete</a>
</li>
<li>
<a id="maxclique_and_pcp">Max-clique and PCP</a>
</li>
<li>
<a id="baker_gill_solovay">Baker-Gill-Solovay theorem</a>
</li>
<li>
<a id="karplipton">Karp-Lipton</a>
</li>
<li>
<a id="BPPincludedInSigma2">\(BPP \subseteq \Sigma_2^p \cap \Pi_2^p\)</a>
</li>
</ul>
<h2>Propositional logic</h2>
<ul>
<li>
<a id="notobviousentailment">A not-so-obvious entailment</a>
</li>
</ul>
</div>
</body>
<script>
</script>
</html>