2150 search results - page 255 / 430 » On a restricted cross-intersection problem |
163
Voted
AAAI
2012
13 years 6 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
137
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
146
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
131
Voted
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
119
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...