730 search results - page 49 / 146 » Combinatorics of Monotone Computations |
130
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
176
click to vote
RANDOM
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
121
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
130
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
103
click to vote
PPSC
1997
15 years 5 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...