Easy problems for tree-decomposable graphs
- 作者Stefan Arnborg; Jens Lagergren; Detlef Seese
- 卷第12卷
- 期第2期
- 印刷ISSN0196-6774
- 电子ISSN1090-2678
- 文件大小1904.26KB
- 发表时间1991
- DOI10.1016/0196-6774(91)90006-k
- 页码308-340
同作者推荐
The security of all RSA and discrete log bitsHåstad, Johan; Nåslund, Mats · Journal of the ACM · 2004
Linear-Consistency TestingYonatan Aumann; Johan Håstad; Michael O. Rabin; Madhu Sudan · 2001
A Slight Sharpening of LMNJohan Håstad · 2001
On average time hierarchiesMikael Goldmann; Per Grape; Johan Håstad · 1994
On bounded occurrence constraint satisfactionJohan Håstad · 2000
The square lattice shuffleJohan Håstad · 2006
Every 2-csp Allows Nontrivial ApproximationJohan Håstad · 2008