Results 11 to 20 of about 359,135 (290)
Numerical Mathematics and Computer Science [PDF]
Numerical mathematics is viewed as the analysis of continuous algorithms. Four of the components of numerical mathematics are discussed. These are: foundations (finite precision number systems, computational compexity), synthesis and analysis of algorithms, analysis of error, programs and program libraries.
exaly +2 more sources
Svetlana Cojocaru (in honour of her 60th anniversary) [PDF]
Our colleague, Vice Editor-in-Chief of the Computer Science Journal of Moldova and director of the Institute of Mathematics and Computer Science of Academy of Sciences of Moldova, dr.hab. Svetlana Cojocaru accomplishes in July a beautiful age.
Editorial board of the "Computer Science Journal of Moldova"
doaj +1 more source
Computer Science Investigations in the Institute of Mathematics [PDF]
The Academy of Sciences of Moldova (Moldavia) had its beginning in 1946, the Institute of Mathematics within it took its present form in 1964. The current director of the Institute has prepared this account of work in computer science or informatics that began in 1962 when the first modern computers appeared in Moldova.
C. Gaindric
doaj +3 more sources
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs [PDF]
An equitable partition into branchings in a digraph is a partition of the arc set into branchings such that the sizes of any two branchings differ at most by one.
Kenjiro Takazawa
doaj +1 more source
Formalizing the Face Lattice of Polyhedra [PDF]
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq.
Xavier Allamigeon +2 more
doaj +1 more source
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs [PDF]
We study the computational complexity of $c$-Colored $P_\ell$ Deletion and $c$-Colored $C_\ell$ Deletion. In these problems, one is given a $c$-edge-colored graph and wants to destroy all induced $c$-colored paths or cycles, respectively, on $\ell ...
Nils Jakob Eckstein +3 more
doaj +1 more source
Destroying Bicolored $P_3$s by Deleting Few Edges [PDF]
We introduce and study the Bicolored $P_3$ Deletion problem defined as follows. The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned into a set $E_r$ of red edges and a set $E_b$ of blue edges.
Niels Grüttemeier +3 more
doaj +1 more source
Taking-and-merging games as rewrite games [PDF]
This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules.
Eric Duchêne +3 more
doaj +1 more source
Relevance and expediency of introduction of a training course of computer mathematics for students of “Secondary Education (Computer Science)” is caused by necessity of use of computer equipment with the corresponding software almost in all areas of ...
Варвара Черненко
doaj +1 more source
On the VC-dimension of half-spaces with respect to convex sets [PDF]
A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that fully contains S' , and no other set of S is fully contained in h.
Nicolas Grelier +3 more
doaj +1 more source

