451 search results - page 35 / 91 » On Parameterized Exponential Time Complexity |
205
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
102
Voted
DLOG
2007
15 years 5 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
110
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
117
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
133
Voted
ECCC
2011
14 years 9 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...