436 search results - page 8 / 88 » A Note on Negligible Functions |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
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...
DAGSTUHL
2006
13 years 9 months ago
2006
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...
DAGSTUHL
2008
13 years 10 months ago
2008
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...
CAGD
2007
13 years 8 months ago
2007
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 ...
SLOGICA
2008
13 years 8 months ago
2008
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...