國立高雄大學圖資館 |

Language: English

Back

Small dynamic complexity classesan i...

SpringerLink (Online service)

Small dynamic complexity classesan investigation into dynamic descriptive complexity /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Small dynamic complexity classesby Thomas Zeume.
Reminder of title:	an investigation into dynamic descriptive complexity /
Author:	Zeume, Thomas.
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg :2017.
Description:	viii, 149 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computational complexity.
Online resource:	http://dx.doi.org/10.1007/978-3-662-54314-6
ISBN:	9783662543146$q(electronic bk.)

Small dynamic complexity classesan 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 ;4891..

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$q(electronic bk.)

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

185313
Computational complexity.

LC Class. No.: QA267.7

Dewey Class. No.: 511.352

Small dynamic complexity classesan investigation into dynamic descriptive complexity /
LDR:01820nmm a2200349 a 4500 001 507261
003 DE-He213
005 20170217033609.0
006 m d
007 cr nn 008maaau
008 171030s2017 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 773790
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 185313
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Software Engineering. $3 274511
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 274102
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Programming Techniques. $3 274470
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-54314-6
950 $a Computer Science (Springer-11645)