Small Dynamic Complexity Classes : An Investigation into Dynamic Descriptive Complexity
Mentés helye:
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Különgyűjtemény: | e-book |
| Formátum: | könyv |
| Nyelv: | angol |
| Megjelenés: |
Berlin ; Heidelberg : Springer Berlin Heidelberg,
2017
|
| Sorozat: | Lecture Notes in Computer Science ; 10110 |
| Tárgyszavak: | |
| Online elérés: | https://doi.org/10.1007/978-3-662-54314-6 |
| Címkék: |
Új címke
A tételhez itt fűzhet saját címkét!
|
| LEADER | nam a22 5i 4500 | ||
|---|---|---|---|
| 001 | 000954715 | ||
| 005 | 20190415140250.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 170217s2017 gw a fsb 001 0 eng d | ||
| 020 | |a 978-3-662-54314-6 | ||
| 024 | 7 | |a 10.1007/978-3-662-54314-6 |2 doi | |
| 040 | |a Springer |b hun |c ELTE | ||
| 041 | 0 | |a eng | |
| 050 | 4 | |a QA76.9.L63 | |
| 050 | 4 | |a QA76.5913 | |
| 050 | 4 | |a QA76.63 | |
| 082 | 0 | 4 | |a 005.1015113 |2 23 |
| 100 | 1 | |a Zeume, Thomas | |
| 245 | 1 | 0 | |a Small Dynamic Complexity Classes |b An Investigation into Dynamic Descriptive Complexity |c by Thomas Zeume |
| 260 | |a Berlin |a Heidelberg |b Springer Berlin Heidelberg |c 2017 | ||
| 300 | |a VIII, 149 p. |b ill. | ||
| 336 | |a szöveg |b txt |2 rdacontent | ||
| 337 | |a számítógépes |b c |2 rdamedia | ||
| 338 | |a távoli hozzáférés |b cr |2 rdacarrier | ||
| 347 | |a szövegfájl |b PDF |2 rda | ||
| 490 | 1 | |a Lecture Notes in Computer Science |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. | ||
| 580 | |a Nyomtatott kiadás: ISBN 9783662543139 | ||
| 580 | |a Nyomtatott kiadás: ISBN 9783662543153 | ||
| 506 | |a Az e-könyvek a teljes ELTE IP-tartományon belül online elérhetők. | ||
| 598 | |a könyv | ||
| 595 | |a e-book | ||
| 650 | 0 | |a Logic design. | |
| 650 | 0 | |a Software engineering. | |
| 650 | 0 | 4 | |a szoftverfejlesztés |
| 650 | 0 | |a Computer science. | |
| 650 | 0 | 4 | |a számítástudomány |
| 650 | 0 | |a Computer software. | |
| 650 | 0 | 4 | |a szoftver |
| 650 | 1 | 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. |
| 653 | |a elektronikus könyv | ||
| 710 | 2 | |a SpringerLink (Online service) |e közreadó testület | |
| 830 | 0 | |a Lecture notes in computer science | |
| 850 | |a B2 | ||
| 856 | 4 | 0 | |y Online változat |u https://doi.org/10.1007/978-3-662-54314-6 |
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |b Imprint: Springer |c 2017 | |