Constructive Proofs
Constructive Proofs is a proof method in mathematics and theoretical computer science that establishes the existence of a mathematical object by explicitly providing an algorithm or procedure for constructing it, particularly within number-theoretic contexts such as solutions guaranteed by the Chinese Remainder Theorem.
390
Publications
19.2K
Citations
611
Authors
335
Institutions
Publications per year
2017–2026
42
Parents
390
Bimatrix Equilibrium Points and Mathematical Programming
C. E. Lemke · Management Science · 1965 · 1K citations · Full text
A New Proof for the Existence of Mutually Unbiased Bases
Algorithmica · 2002 · 568 citations
On channel capacity per unit cost
Sergio Verdú · IEEE Transactions on Information Theory · 1990 · 548 citations
A formulae-as-type notion of control
Timothy G. Griffin · 1990 · 506 citations
1–5 of 390
611
5
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 611
335

Centre National de la Recherche Scientifique
Paris, France
8 h-index
13 publications
358 citations

Cornell University
Ithaca, United States
6 h-index
7 publications
756 citations
University of California, Los Angeles
Los Angeles, United States
5 h-index
10 publications
2.1K citations
Université Paris Cité
Paris, France
5 h-index
5 publications
118 citations
University of California, Berkeley
Berkeley, United States
5 h-index
11 publications
426 citations
University of Chicago
Chicago, United States
5 h-index
8 publications
359 citations

University of Padua
Padua, Italy
4 h-index
7 publications
137 citations
University of Maryland, College Park
College Park, United States
4 h-index
5 publications
133 citations
1–8 of 335
13 publications · 655 citations
11
h-index
12 publications · 578 citations
11
h-index
10 publications · 353 citations
10
h-index
7 publications · 152 citations
7
h-index
PROC · 6 publications · 251 citations
6
h-index
1–5