Title | ||
---|---|---|
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs |
Abstract | ||
---|---|---|
Without Abstract |
Year | Venue | Keywords |
---|---|---|
1995 | Lecture Notes in Computer Science | classical proofs,greatest common divisor,case study,program extraction |
Field | DocType | Volume |
Discrete mathematics,Natural number,Notation,Divisibility rule,Computer science,Quotient,Remainder,Mathematical proof,Greatest common divisor,Realizability | Conference | 1158 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-61780-9 | 5 |
PageRank | References | Authors |
1.17 | 3 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ulrich Berger | 1 | 197 | 18.25 |
Helmut Schwichtenberg | 2 | 373 | 44.83 |