Discrete Mathematics & Theoretical Computer Science
| author: | Anna Bernasconi |
|---|---|
| title: | On a hierarchy of Boolean functions hard to compute in constant depth |
| keywords: | Boolean functions, AC0 circuits, size complexity, harmonic analysis |
| abstract: | Any attempt to find connections between mathematical properties and complexity has a strong relevance
to the field of Complexity Theory.
This is due to the lack of mathematical techniques to prove lower
bounds for general models of computation. This work represents a step in this direction: we define a combinatorial property that makes Boolean functions ``hard'' to compute in constant depth and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds on the size complexity of previously unclassified Boolean functions. |
| reference: | Anna Bernasconi (2001), On a hierarchy of Boolean functions hard to compute in constant depth, Discrete Mathematics and Theoretical Computer Science 4, pp. 79-90 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm040201.ps.gz (37 K) |
| ps-source: | dm040201.ps (98 K) |
| pdf-source: | dm040201.pdf (103 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.