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!
|
| id |
opac-EUL01-000954715 |
|---|---|
| collection |
e-book |
| institution |
L_042 EUL01 |
| spelling |
Zeume, Thomas Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity by Thomas Zeume Berlin Heidelberg Springer Berlin Heidelberg 2017 VIII, 149 p. ill. szöveg txt rdacontent számítógépes c rdamedia távoli hozzáférés cr rdacarrier szövegfájl PDF rda 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. Nyomtatott kiadás: ISBN 9783662543139 Nyomtatott kiadás: ISBN 9783662543153 Az e-könyvek a teljes ELTE IP-tartományon belül online elérhetők. könyv e-book Logic design. Software engineering. szoftverfejlesztés Computer science. számítástudomány Computer software. szoftver Logics and Meanings of Programs. Software Engineering. Mathematical Logic and Formal Languages. Programming Languages, Compilers, Interpreters. Algorithm Analysis and Problem Complexity. Programming Techniques. elektronikus könyv SpringerLink (Online service) közreadó testület Lecture notes in computer science Online változat https://doi.org/10.1007/978-3-662-54314-6 Berlin, Heidelberg Springer Berlin Heidelberg Imprint: Springer 2017 EUL01 |
| language |
English |
| format |
Book |
| author |
Zeume, Thomas |
| spellingShingle |
Zeume, Thomas Small Dynamic Complexity Classes : An Investigation into Dynamic Descriptive Complexity Lecture Notes in Computer Science ; 10110 Logic design. Software engineering. szoftverfejlesztés Computer science. számítástudomány Computer software. szoftver Logics and Meanings of Programs. Software Engineering. Mathematical Logic and Formal Languages. Programming Languages, Compilers, Interpreters. Algorithm Analysis and Problem Complexity. Programming Techniques. elektronikus könyv |
| author_facet |
Zeume, Thomas SpringerLink (Online service), közreadó testület |
| author_corporate |
SpringerLink (Online service), közreadó testület |
| author_sort |
Zeume, Thomas |
| title |
Small Dynamic Complexity Classes : An Investigation into Dynamic Descriptive Complexity |
| title_sub |
An Investigation into Dynamic Descriptive Complexity |
| title_short |
Small Dynamic Complexity Classes |
| title_full |
Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity by Thomas Zeume |
| title_fullStr |
Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity by Thomas Zeume |
| title_full_unstemmed |
Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity by Thomas Zeume |
| title_auth |
Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity |
| title_sort |
small dynamic complexity classes an investigation into dynamic descriptive complexity |
| series |
Lecture Notes in Computer Science ; 10110 |
| series2 |
Lecture notes in computer science |
| publishDate |
2017 |
| publishDateSort |
2017 |
| physical |
VIII, 149 p. : ill. |
| isbn |
978-3-662-54314-6 |
| callnumber-first |
Q - Science |
| callnumber-subject |
QA - Mathematics |
| callnumber-label |
QA76 |
| callnumber-raw |
13848 |
| callnumber-search |
13848 |
| topic |
Logic design. Software engineering. szoftverfejlesztés Computer science. számítástudomány Computer software. szoftver Logics and Meanings of Programs. Software Engineering. Mathematical Logic and Formal Languages. Programming Languages, Compilers, Interpreters. Algorithm Analysis and Problem Complexity. Programming Techniques. elektronikus könyv |
| topic_facet |
Logic design. Software engineering. szoftverfejlesztés Computer science. számítástudomány Computer software. szoftver Logics and Meanings of Programs. Software Engineering. Mathematical Logic and Formal Languages. Programming Languages, Compilers, Interpreters. Algorithm Analysis and Problem Complexity. Programming Techniques. elektronikus könyv Logic design. Software engineering. szoftverfejlesztés Computer science. számítástudomány Computer software. szoftver Logics and Meanings of Programs. Software Engineering. Mathematical Logic and Formal Languages. Programming Languages, Compilers, Interpreters. Algorithm Analysis and Problem Complexity. Programming Techniques. |
| url |
https://doi.org/10.1007/978-3-662-54314-6 |
| illustrated |
Illustrated |
| dewey-hundreds |
000 - Computer science, information & general works |
| dewey-tens |
000 - Computer science, knowledge & systems |
| dewey-ones |
005 - Computer programming, programs & data |
| dewey-full |
005.1015113 |
| dewey-sort |
15.1015113 |
| dewey-raw |
005.1015113 |
| dewey-search |
005.1015113 |
| first_indexed |
2023-12-26T23:17:47Z |
| last_indexed |
2023-12-29T19:19:17Z |
| recordtype |
opac |
| publisher |
Berlin ; Heidelberg : Springer Berlin Heidelberg |
| _version_ |
1786641340138782720 |
| score |
13,365248 |
| generalnotes |
"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. |