新生學校財團法人新生醫護管理專科學校圖書館 |

語系: 繁體中文

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Efficient solving of large arithmeti...

SpringerLink (Online service)

Efficient solving of large arithmetic constraint systems with complex Boolean structure = proof engines for the analysis of hybrid discrete-continuous systems /

紀錄類型:	書目-電子資源 : 單行本
正題名/作者:	Efficient solving of large arithmetic constraint systems with complex Boolean structure/ by Christian Herde.
其他題名:	proof engines for the analysis of hybrid discrete-continuous systems /
作者:	Herde, Christian.
出版者:	Wiesbaden :Vieweg+Teubner Verlag / Springer Fachmedien Wiesbaden GmbH, Wiesbaden, : 2011.,
面頁冊數:	xvi, 163 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
標題:	Automatic theorem proving. -
電子資源:	http://dx.doi.org/10.1007/978-3-8348-9949-1
ISBN:	9783834899491 (electronic bk.)

Efficient solving of large arithmetic constraint systems with complex Boolean structure = proof engines for the analysis of hybrid discrete-continuous systems /
Herde, Christian.

Efficient solving of large arithmetic constraint systems with complex Boolean structureproof engines for the analysis of hybrid discrete-continuous systems /[electronic resource] :by Christian Herde. - Wiesbaden :Vieweg+Teubner Verlag / Springer Fachmedien Wiesbaden GmbH, Wiesbaden,2011. - xvi, 163 p. :ill., digital ;24 cm.

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

127137
Automatic theorem proving.

LC Class. No.: QA76.9.A96 / H47 2011

Dewey Class. No.: 004.015113

Efficient solving of large arithmetic constraint systems with complex Boolean structure = proof engines for the analysis of hybrid discrete-continuous systems /
LDR:00866nmm 2200229 a 4500 001 163426
003 Springer
005 20110720162629.0
006 m d
007 cr nn 008maaau
008 160223s2011 gw s j eng d
020 $a 9783834899491 (electronic bk.)
020 $a 9783834814944 (paper)
035 $a 978-3-8348-1494-4
050 0 4 $a QA76.9.A96 $b H47 2011
082 0 4 $a 004.015113 $2 22
090 $a QA76.9.A96 $b H541 2011
100 1 $a Herde, Christian. $3 316125
245 1 0 $a Efficient solving of large arithmetic constraint systems with complex Boolean structure $h [electronic resource] : $b proof engines for the analysis of hybrid discrete-continuous systems / $c by Christian Herde.
260 $a Wiesbaden : $c 2011. $b Vieweg+Teubner Verlag / Springer Fachmedien Wiesbaden GmbH, Wiesbaden,
300 $a xvi, 163 p. : $b ill., digital ; $c 24 cm.
650 0 $a Automatic theorem proving. $3 127137
650 0 $a Constraints (Artificial intelligence) $v Congresses. $3 127469 $3 176589
650 0 $a Computer science $x Mathematics. $3 97378
650 1 4 $a Computer Science. $3 120417
650 2 4 $a Computer Science, general. $3 121038
710 2 $a SpringerLink (Online service) $3 120363
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-8348-9949-1
950 $a Computer Science (Springer-11645)

筆 0 讀者評論

多媒體

評論

Export

取書館別