2181 search results - page 44 / 437 » The restriction scaffold problem |
130
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
133
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
102
click to vote
IJCAI
1997
15 years 5 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
114
Voted
AIPS
1994
15 years 5 months ago
1994
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
133
Voted
DAM
2007
15 years 3 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...