10890 search results - page 197 / 2178 » Automatic Complexity Analysis |
164
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
184
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
184
click to vote
CCE
2006
15 years 6 months ago
2006
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
182
click to vote
JACM
2010
15 years 4 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
158
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...