568 search results - page 1 / 114 » New bounds for the Cebysev functional |
APPML
2005
13 years 4 months ago
2005
Some new inequalities for the Cebysev functional in terms of the first derivative and applications for Taylor's expansion and generalised trapezoid formula are pointed out.
QEST
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—ITPN-PerfBound is a graphical tool for the modeling and performance bound analysis of Interval Time Petri Nets (ITPN), that has been developed within the DrawNET modelin...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
IPL
2010
13 years 2 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...