The complexity of valued constraint satisfaction problems
Stanislav Zivny ([, Springer-Verlag], 2012)
|
In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques. |
The Complexity of Valued Constraint Satisfaction Problems.pdf :: Unduh
|
No. Panggil : | e20408537 |
Entri utama-Nama orang : | |
Subjek : | |
Penerbitan : | Berlin: [, Springer-Verlag], 2012 |
Sumber Pengatalogan: | LibUI eng rda |
Tipe Konten: | text |
Tipe Media: | computer |
Tipe Pembawa: | online resource |
Deskripsi Fisik: | |
Tautan: | http://link.springer.com/book/10.1007%2F978-3-642-33974-5 |
Lembaga Pemilik: | |
Lokasi: |
No. Panggil | No. Barkod | Ketersediaan |
---|---|---|
e20408537 | TERSEDIA |
Ulasan: |
Tidak ada ulasan pada koleksi ini: 20408537 |