2412 search results - page 141 / 483 » Which Problems Have Strongly Exponential Complexity |
125
Voted
PDP
2007
IEEE
15 years 9 months ago
2007
IEEE
As the use of complex grid middleware becomes widespread and more facilites are offered by these pieces of software, distributed Grid applications are becoming more and more popul...
154
Voted
TCAD
1998
15 years 3 months ago
1998
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
126
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
153
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
156
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...