1199 search results - page 83 / 240 » Parameterized Proof Complexity |
94
Voted
CC
2006
Springer
15 years 25 days ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
133
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
81
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
116
Voted
TARK
2009
Springer
15 years 7 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
108
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...