|
|
|
|
| LEADER |
02853nam a22006135i 4500 |
| 001 |
978-3-662-54314-6 |
| 003 |
DE-He213 |
| 005 |
20170217033609.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170217s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783662543146
|9 978-3-662-54314-6
|
| 024 |
7 |
|
|a 10.1007/978-3-662-54314-6
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 050 |
|
4 |
|a QA76.63
|
| 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 005.1015113
|2 23
|
| 100 |
1 |
|
|a Zeume, Thomas.
|e author.
|
| 245 |
1 |
0 |
|a Small Dynamic Complexity Classes
|h [electronic resource] :
|b An Investigation into Dynamic Descriptive Complexity /
|c by Thomas Zeume.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a VIII, 149 p. 17 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 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 Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783662543139
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 10110
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-662-54314-6
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
