Unveiling the Digital Equation Through Innovative Approaches for Teaching Discrete Mathematics to Future Computer Science Educators [PDF]
, 2023 Zinagul Suranchiyeva +4 more
openalex +1 more source
For the Jubilee of Vladimir Mikhailovich Chernov [PDF]
, 2019 On April 25, 2019, Vladimir Chernov celebrated his 70th birthday, Doctor of Physics and Mathematics, Chief Researcher at the Laboratory of Mathematical Methods of Image Processing of the Image Processing Systems Institute of the Russian Academy of ...
Labunets, V. G., Smetanin, Y. G.
core
Self-Evaluation Applied Mathematics 2003-2008 University of Twente [PDF]
, 2009 This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT).
Mouthaan, A.J., Vegt, J.J.W. van der
core +1 more source
A survey on algorithmic aspects of modular decomposition
, 2009 The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important preprocessing step to
Habib, Michel, Paul, Christophe
core +3 more sources
A Primer on the Tools and Concepts of Computable Economics [PDF]
, 2004 Computability theory came into being as a result of Hilbert's attempts to meet Brouwer's challenges, from an intuitionistc and constructive standpoint, to formalism as a foundation for mathematical practice.
Velupillai, K. Vela
core +1 more source
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
, 2007 We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}.
Homan, Christopher M., Kosub, Sven
core +3 more sources
The spectrum and toughness of regular graphs [PDF]
, 2013 In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\lambda-2$, where $\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$.
Cioabă, Sebastian M., Wong, Wiseley
core
Combinatorial optimization and metaheuristics [PDF]
, 2006 Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational ...
Consoli, S, Darby-Dowman, K
core
Bioconsensus.—M. F. Janowitz, F.-J. Lapointe, F. R. McMorris, B. Mirkin, and F. S. Roberts, editors. (DIMACS series in discrete mathematics and theoretical computer science, v. 61). 2003. American Mathematical Society. 242 pp. ISBN 0–8218–3197–6. $75.00. [PDF]
, 2004 Tanya Berger‐Wolf
openalex +1 more source
Discrete logarithms in curves over finite fields [PDF]
, 2007 A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite ...
Andreas Enge +4 more
core +5 more sources