Results 151 to 160 of about 69,347 (192)

Reviews of the book "Discrete Mathematics for Computer Science, Part I: Elementary combinatorics'' by J. Jaworskiego, Z. Palki and J. Szymańskiego

open access: closedMathematica Applicanda, 2012
T he book under review is based on discrete mathematics lectures conducted for students of mathematics and computer science. This is the first of two planned volumes. Published volume is dedicated to combinatorics , announced the second volume will cover the most important graph theory and algorithms ...
Małgorzata Kuchta
openaire   +2 more sources

An Analysis of Statements of the Multiplication Principle in Combinatorics, Discrete, and Finite Mathematics Textbooks

open access: closedInternational Journal of Research in Undergraduate Mathematics Education, 2016
The multiplication principle serves as a cornerstone in enumerative combinatorics. The principle underpins many basic counting formulas and provides students with a critical element of combinatorial justification. Given its importance, the way in which it is presented in textbooks is surprisingly varied. In this paper, we analyze a number of university
Elise Lockwood   +2 more
openaire   +2 more sources

Applied Discrete Mathematics, Combinatorics, Cryptography, Computer Science and Computation

open access: closedJournal of Discrete Mathematical Sciences and Cryptography
This special issue of “Applied Discrete Mathematics, Combinatorics, Cryptography, Computer Science and Computation”, presents a selection of cutting-edge research in the fields of cryptography, algebra, and module theory. These areas continue to evolve and provide foundational insights for modern technology, particularly in the realms of secure ...
Mohammad Reza Farahani   +4 more
openaire   +2 more sources

Some Innovations in Section “Combinatorics” of Discrete Mathematics Course

open access: closed2023 3rd International Conference on Technology Enhanced Learning in Higher Education (TELE), 2023
Alexander N. Vybornov
openaire   +2 more sources

APPLICATION OF COMBINATORICS IN DISCRETE MATHEMATICS AND ALGORITHMS

Combinatorics, as a branch of discrete mathematics, studies combinatorial structures and methods of their analysis. Its core tools, such as permutations, combinations, and placements, play a key role in various fields, including algorithms, optimization, cryptography, and graph theory. In this article, we will look at how combinatorics is used to solve
openaire   +1 more source

Home - About - Disclaimer - Privacy