Results 11 to 20 of about 324,082 (166)

On Teaching Discrete Mathematics to Freshman Computer Science Students [PDF]

open access: bronzeJournal of Higher Education Theory and Practice, 2019
Faron Moller, Liam O'Reilly
openalex   +4 more sources

Research on Curriculum Reform and Practice of Discrete Mathematics in Computer Science [PDF]

open access: bronze2023 2nd International Conference on Education, Humanities, Management and Information Technology (EHMIT 2023), 2023
Yuting Dai
openalex   +2 more sources

Primary Historical Sources in the Classroom: Discrete Mathematics and Computer Science [PDF]

open access: green, 2013
Janet Heine Barnett   +7 more
openalex   +2 more sources

An Exploration into Adaptive Teaching of Discrete Mathematics for Computer Science Undergraduate Students

open access: bronzeProceedings of the 54th ACM Technical Symposium on Computer Science Education V. 2, 2022
Yuni Xia, Shiaofen Fang, Kathy Johnson
openalex   +2 more sources

Theoretical Computer Science and Discrete Mathematics [PDF]

open access: closed, 2017
S. Arumugam   +3 more
openalex   +3 more sources

Teaching Discrete Mathematics to Computer Science Students [PDF]

open access: yes, 2019
Discrete Mathematics is an inevitable part of any undergraduate computer science degree programme. However, computer science students typically find this to be at best a necessary evil with which they struggle to engage. Twenty years ago, we started to address this issue seriously in our university, and we have instituted a number of innovations ...
Faron Moller, Liam O’Reilly
openaire   +3 more sources

On the critical exponent of generalized Thue-Morse words [PDF]

open access: yes, 2007
For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.Comment: 13 pages; to appear
Blondin-Massé, Alexandre   +3 more
core   +5 more sources

Flows on Simplicial Complexes [PDF]

open access: yes, 2012
Given a graph $G$, the number of nowhere-zero $\ZZ_q$-flows $\phi_G(q)$ is known to be a polynomial in $q$. We extend the definition of nowhere-zero $\ZZ_q$-flows to simplicial complexes $\Delta$ of dimension greater than one, and prove the polynomiality
Beck, Matthias, Kemper, Yvonne
core   +5 more sources

Home - About - Disclaimer - Privacy