(Enter summary)
Abstract: This thesis presents results on lower bounds for circuit complexity, implications
of some of these bounds for relativized complexity, and lower bounds for median
selection. (Update)
Similar documents (at the sentence level):
10.1%: Symmetric Approximation Arguments for Monotone Lower Bounds.. - Berg, Ulfberg (1997)
(Correct)
8.3%: On Lower Bounds for Selecting the Median - Dor, Håstad, Ulfberg, Zwick (1997)
(Correct)
5.4%: A Lower Bound for Perceptrons and an Oracle Separation of the.. - Berg, Ulfberg (1997)
(Correct)
Similar documents based on text: More All
1.6: Some New Randomized Approximation Algorithms - Andersson (2000)
(Correct)
1.2: Monitoring, Testing and Debugging of Distributed Real-Time Systems - Thane (2000)
(Correct)
1.1: Designing, evaluating and exploring Web-based tools for.. - Rodríguez (2003)
(Correct)
BibTeX entry: (Update)
@inproceedings{ ulfberg99lower,
author = "Ulfberg",
title = "On Lower Bounds for Circuits and Selection",
booktitle = "{ECCCTH}: Electronic Colloquium on Computational Complexity, theses",
year = "1999",
url = "citeseer.ist.psu.edu/ulfberg99lower.html" }
Citations not processed or no citations identified.
Documents on the same site (http://www.nada.kth.se/~staffanu/research.html):
Computational Aspects of a Stochastic Metapopulation Model - Ulfberg (1993)
(Correct)
A Lower Bound for Perceptrons and an Oracle Separation of the.. - Berg, Ulfberg (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC