Small dynamic complexity classes : an investigation into dynamic descriptive complexity

• 作者： Zeume, Thomas, author.
• 其他作者：
  • SpringerLink (Online service)
• 其他題名：
  • Lecture notes in computer science ;
• 出版： Berlin, Heidelberg : Springer Berlin Heidelberg :Imprint: Springer
• 叢書名： Lecture notes in computer science,10110
• 主題： Computational complexity. , Computer Science. , Logics and Meanings of Programs. , Software Engineering. , Mathematical Logic and Formal Languages. , Programming Languages, Compilers, Interpreters. , Algorithm Analysis and Problem Complexity. , Programming Techniques.
• ISBN： 9783662543146 (electronic bk.) 、 9783662543139 (paper)
• FIND@SFXID: CGU
• 資料類型: 電子書
• 內容註: Dynamic Complexity: Definitions and Examples -- Relating Small Dynamic Complexity Classes -- Lower Bounds for Dynamic Complexity Classes.
• More
• 摘要註: "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.
• 讀者標籤：

  需登入
• 引用連結：

  Copy Link
• 目前引用數
• Share: