900 search results - page 23 / 180 » On Polynomial Time Computation over Unordered Structures |
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We present a simple dynamic equilibrium model for an online exchange where both buyers and sellers arrive according to a exogenously defined stochastic process. The structure of t...
104
click to vote
CONCUR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
102
click to vote
LICS
2009
IEEE
15 years 8 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
196
click to vote
EDBT
2011
ACM
14 years 5 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
MST
2006
15 years 1 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...