172 search results - page 20 / 35 » The Complexity of Unions of Disjoint Sets |
145
Voted
COCO
2009
Springer
15 years 8 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
111
click to vote
AI
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
140
Voted
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
178
click to vote
EDBT
2008
ACM
16 years 1 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
140
click to vote
TACAS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...