Document Open Access Logo

Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures

Author William Hesse



PDF
Thumbnail PDF

File

DagSemProc.06451.5.pdf
  • Filesize: 65 kB
  • 3 pages

Document Identifiers

Author Details

William Hesse

Cite AsGet BibTex

William Hesse. Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.06451.5

Abstract

While researching dynamic data structures of polynomial size that are updated by extremely simple circuits, we have come across many interesting algebraic problems. Some of these simple questions about small sums and products in an algebra would give lower bounds on the complexity of dynamic data structures.
Keywords
  • Boolean Functions
  • auxiliary data
  • circuit complexity
  • lower bounds

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail