1199 search results - page 184 / 240 » Parameterized Proof Complexity |
104
Voted
CORR
2008
Springer
15 years 28 days ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
92
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
112
Voted
DCG
2008
15 years 27 days ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
89
Voted
JAIR
2008
15 years 25 days ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
101
click to vote
CPC
2004
15 years 20 days ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...