DROPS

Document

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

Authors: William Hesse

Published in: Dagstuhl Seminar Proceedings, Volume 6451, Circuits, Logic, and Games (2007)

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.

Cite as

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)

Copy BibTex To Clipboard

@InProceedings{hesse:DagSemProc.06451.5,
  author =	{Hesse, William},
  title =	{{Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures}},
  booktitle =	{Circuits, Logic, and Games},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6451},
  editor =	{Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06451.5},
  URN =		{urn:nbn:de:0030-drops-9749},
  doi =		{10.4230/DagSemProc.06451.5},
  annote =	{Keywords: Boolean Functions, auxiliary data, circuit complexity, lower bounds}
}

Search Results

Documents authored by Hesse, William

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

Abstract

Cite as

Thanks for your feedback!

Could not send message