Some beautiful arguments using mathematical induction
From MaRDI portal
Publication:1140430
DOI10.1007/BF00288531zbMath0435.68055MaRDI QIDQ1140430
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
03-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations
68R99: Discrete mathematics in relation to computer science
Related Items
A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS, A note on adaptive parallel sorting, An efficient algorithm for maxdominance, with applications, Finding a minimum independent dominating set in a permutation graph, An algorithm for the determination of longest increasing subsequence in a sequence, Another look at the longest ascending subsequence problem, Some modified algorithms for Dijkstra's longest upsequence problem, Drawing graphs in two layers, The impact of the apex node on routing inside a pyramid structure