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...
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...
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...
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...