We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
Techniques of reliable computing, like interval arithmetic, can be used to guarantee reliable solutions even in the presence of numerical round-off errors. The need to trace bounds...
Energies of curves and surfaces together with their discrete variants play a prominent role as fairness functionals in geometric modeling and computer aided geometric design. This ...
The work on prototypes in ontologies pioneered by Rosch [10] and elaborated by Lakoff [8] and Freund [3] is related to vagueness in the sense that the more remote an instance is fr...