東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Small dynamic complexity classes = a...

Zeume, Thomas.

FindBook

Google Book

Amazon

博客來

Small dynamic complexity classes = an investigation into dynamic descriptive complexity /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Small dynamic complexity classes/ by Thomas Zeume.
其他題名:	an investigation into dynamic descriptive complexity /
作者:	Zeume, Thomas.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2017.,
面頁冊數:	viii, 149 p. :ill., digital ;24 cm.
內容註:	Dynamic Complexity: Definitions and Examples -- Relating Small Dynamic Complexity Classes -- Lower Bounds for Dynamic Complexity Classes.
Contained By:	Springer eBooks
標題:	Computational complexity. -
電子資源:	http://dx.doi.org/10.1007/978-3-662-54314-6
ISBN:	9783662543146

Small dynamic complexity classes = an investigation into dynamic descriptive complexity /
Zeume, Thomas.

Small dynamic complexity classesan investigation into dynamic descriptive complexity /[electronic resource] :by Thomas Zeume. - Berlin, Heidelberg :Springer Berlin Heidelberg :2017. - viii, 149 p. :ill., digital ;24 cm. - Lecture notes in computer science,101100302-9743 ;. - Lecture notes in computer science ;10110..

Dynamic Complexity: Definitions and Examples -- Relating Small Dynamic Complexity Classes -- Lower Bounds for Dynamic Complexity Classes.

"Small Dynamic Complexity Classes" was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas.

ISBN: 9783662543146

Standard No.: 10.1007/978-3-662-54314-6doiSubjects--Topical Terms:

523870
Computational complexity.

LC Class. No.: QA267.7

Dewey Class. No.: 511.352

Small dynamic complexity classes = an investigation into dynamic descriptive complexity /
LDR:01820nmm a2200349 a 4500 001 2090149
003 DE-He213
005 20170217033609.0
006 m d
007 cr nn 008maaau
008 171013s2017 gw s 0 eng d
020 $a 9783662543146 $q (electronic bk.)
020 $a 9783662543139 $q (paper)
024 7 $a 10.1007/978-3-662-54314-6 $2 doi
035 $a 978-3-662-54314-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.7
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 511.352 $2 23
090 $a QA267.7 $b .Z62 2017
100 1 $a Zeume, Thomas. $3 3221427
245 1 0 $a Small dynamic complexity classes $h [electronic resource] : $b an investigation into dynamic descriptive complexity / $c by Thomas Zeume.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2017.
300 $a viii, 149 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10110
505 0 $a Dynamic Complexity: Definitions and Examples -- Relating Small Dynamic Complexity Classes -- Lower Bounds for Dynamic Complexity Classes.
520 $a "Small Dynamic Complexity Classes" was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas.
650 0 $a Computational complexity. $3 523870
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 891123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Programming Techniques. $3 892496
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10110. $3 3221428
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-54314-6
950 $a Computer Science (Springer-11645)