57 search results - page 12 / 12 » Non-uniform Boolean Constraint Satisfaction Problems with Ca... |
SODA
2010
ACM
13 years 4 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
WG
1994
Springer
13 years 9 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...