477 search results - page 57 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
PODS
2005
ACM
14 years 9 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
SPIRE
2010
Springer
13 years 7 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...