東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

The complexity of valued constraint ...

Zivny, Stanislav.{me_controlnum}

Linked to FindBook

Google Book

Amazon

博客來

The complexity of valued constraint satisfaction problems

Record Type:	Electronic resources : Monograph/item
Title/Author:	The complexity of valued constraint satisfaction problems/ by Stanislav Zivny.
Author:	Zivny, Stanislav.{me_controlnum}
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2012.,
Description:	xvii, 170 p. :ill., digital ;24 cm.
[NT 15003449]:	Chap. 1 -- Introduction -- Chap. 2 -- Background -- Chap. 3 -- Expressibility of Valued Constraints -- Chap. 4 -- Expressibility of Fixed-Arity Languages -- Chap. 5 -- Expressibility of Submodular Languages -- Chap. 6 -- Non-expressibility of Submodular Languages -- Chap. 7 -- Tractable Languages -- Chap. 8 -- Conservative Languages -- Chap. 9 -- The Power of Linear Programming -- Chap. 10 -- Hybrid Tractability -- Chap. 11 -- Summary and Open Problems -- References -- Index.
Contained By:	Springer eBooks
Subject:	Constraint programming (Computer science) -
Online resource:	http://dx.doi.org/10.1007/978-3-642-33974-5
ISBN:	9783642339745 (electronic bk.)

The complexity of valued constraint satisfaction problems
Zivny, Stanislav.{me_controlnum}

The complexity of valued constraint satisfaction problems[electronic resource] /by Stanislav Zivny. - Berlin, Heidelberg :Springer Berlin Heidelberg :2012. - xvii, 170 p. :ill., digital ;24 cm. - Cognitive technologies,1611-2482. - Cognitive technologies..

Chap. 1 -- Introduction -- Chap. 2 -- Background -- Chap. 3 -- Expressibility of Valued Constraints -- Chap. 4 -- Expressibility of Fixed-Arity Languages -- Chap. 5 -- Expressibility of Submodular Languages -- Chap. 6 -- Non-expressibility of Submodular Languages -- Chap. 7 -- Tractable Languages -- Chap. 8 -- Conservative Languages -- Chap. 9 -- The Power of Linear Programming -- Chap. 10 -- Hybrid Tractability -- Chap. 11 -- Summary and Open Problems -- References -- Index.

ISBN: 9783642339745 (electronic bk.)Subjects--Topical Terms:

672805
Constraint programming (Computer science)

Dewey Class. No.: 005.11

The complexity of valued constraint satisfaction problems
LDR:01322nmm a2200265 a 4500 001 1329214
003 DE-He213
005 20121205141751.0
006 m d
007 cr nn 008maaau
008 130207s2012 gw s 0 eng d
020 $a 9783642339745 (electronic bk.)
020 $a 9783642339738 (paper)
035 $a 978-3-642-33974-5
040 $a GP $c GP
041 0 $a eng
082 0 4 $a 005.11 $2 23
090 $a QA76.612 $b .Z82 2012
100 1 $a Zivny, Stanislav.{me_controlnum} $3 1620926
245 1 4 $a The complexity of valued constraint satisfaction problems $h [electronic resource] / $c by Stanislav Zivny.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2012.
300 $a xvii, 170 p. : $b ill., digital ; $c 24 cm.
490 1 $a Cognitive technologies, $x 1611-2482
505 0 $a Chap. 1 -- Introduction -- Chap. 2 -- Background -- Chap. 3 -- Expressibility of Valued Constraints -- Chap. 4 -- Expressibility of Fixed-Arity Languages -- Chap. 5 -- Expressibility of Submodular Languages -- Chap. 6 -- Non-expressibility of Submodular Languages -- Chap. 7 -- Tractable Languages -- Chap. 8 -- Conservative Languages -- Chap. 9 -- The Power of Linear Programming -- Chap. 10 -- Hybrid Tractability -- Chap. 11 -- Summary and Open Problems -- References -- Index.
650 0 $a Constraint programming (Computer science) $3 672805
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a Mathematical Logic and Foundations. $3 892656
650 2 4 $a Mathematics of Computing. $3 891213
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Cognitive technologies. $3 1567587
856 4 0 $u http://dx.doi.org/10.1007/978-3-642-33974-5
950 $a Computer Science (Springer-11645)