Some beautiful arguments using mathematical induction
From MaRDI portal
Publication:1140430
DOI10.1007/BF00288531zbMath0435.68055OpenAlexW2135436879MaRDI QIDQ1140430
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288531
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Discrete mathematics in relation to computer science (68R99)
Related Items
Drawing graphs in two layers, A visit to mutual exclusion in seven dates, Computing the all-pairs longest chains in the plane, 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, On difunctions, Another look at the longest ascending subsequence problem, Some modified algorithms for Dijkstra's longest upsequence problem, A note on adaptive parallel sorting, A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS, The impact of the apex node on routing inside a pyramid structure, Election in fully anonymous shared memory systems: tight space bounds and algorithms
