Results 171 to 180 of about 15,138 (216)
Some of the next articles are maybe not open access.
Review of Essential Discrete Mathematics for Computer Science By Harry Lewis and Rachel Zax
ACM SIGACT News, 2020In this column we state a class of open problems that are well known in Ramsey Theory but probably not to my non-Ramsey readers. Nothing I present is original.
openaire +2 more sources
Connecting Discrete Mathematics and Computer Science
2022Computer science majors taking a non-programming-based course like discrete mathematics might ask 'Why do I need to learn this?' Written with these students in mind, this text introduces the mathematical foundations of computer science by providing a comprehensive treatment of standard technical topics while simultaneously illustrating some of the ...
openaire +1 more source
A Discrete Mathematics Package for Computer Science and Engineering Students
2005Discrete mathematics is one of the very basic mathematics courses in computer engineering (CE) and/or computer science (CS) departments. This course covers almost all of the basic concepts for many other courses in the curriculum and requires active learning of students.
openaire +3 more sources
Discrete mathematics for computer science majors—where are we? How do we proceed?
ACM SIGCSE Bulletin, 1989It has been nine years since Anthony Ralston and Mary Shaw called for a rethinking of the importance of sound mathematical training for undergraduate computer science majors [14]. In their paper they stressed the need to develop a two-year sequence in discrete mathematics for beginning computer science majors.
openaire +3 more sources
Research Area 3: Mathematical Sciences: 3.4, Discrete Mathematics and Computer Science
2015Abstract : Many modern applications require modeling and analysis of functions on large, high dimensional, unstructured data sets. One may assume that the data lies on a low dimensional manifold, but this manifold is not known. We have extended the diffusion geometry paradigm for these problems to study function approximation on data defined manifolds.
openaire +2 more sources
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, 2000
Over a period of thirty years there have been many curriculum reforms in the Undergraduate Computer Science curriculum. The ACM/IEEE-CS task force is currently working on the Curriculum 2001. In this struggle to define and develop this dynamic field of computer science, we have the opportunity to identify the foundations and related concepts of ...
Peter B. Hendersen +4 more
openaire +2 more sources
Over a period of thirty years there have been many curriculum reforms in the Undergraduate Computer Science curriculum. The ACM/IEEE-CS task force is currently working on the Curriculum 2001. In this struggle to define and develop this dynamic field of computer science, we have the opportunity to identify the foundations and related concepts of ...
Peter B. Hendersen +4 more
openaire +2 more sources
Discrete mathematics, Computer science, Logic, Proof 1 , and their relationships
2021Faïza Chellougui +2 more
openaire +1 more source
Discrete Mathematics and Theoretical Computer Science
2003Cristian S. Calude +2 more
openaire +2 more sources
Applications of Discrete Mathematics in Computer Science: Algorithms, Graph Theory, and Beyond
Communications on Applied Nonlinear AnalysisDiscrete mathematics has a central importance in the fundamental parts of the theory of computers. From the development of powerful algorithms to graph theory and optimization of networks discrete mathematics plays a role in the analysis and solution of computational problems.
openaire +1 more source