Article thumbnail

Connections Between Complexity Lower Bounds and Meta-Computational Upper Bounds

By Marco Leandro Carmosino

Abstract

This dissertation presents several results at the intersection ofcomplexity theory and algorithm design. Complexity theory aims tolower-bound the amount of computational resources (such as time andspace) required to solve interesting problems. Algorithm design aimsto upper-bound the amount of computational resources required to solveinteresting problems. These pursuits appear opposed. However, somealgorithm design and complexity lower bound problems are inextricablyconnected.This dissertation explores several such connections. From "natural"proofs of circuit-size lower bounds, we create learningalgorithms. From the exact hardness of problems in polynomial time, wecreate algorithms of estimating the acceptance probability ofcircuits. Finally, from algorithms for testing the identity ofairthmetic circuits over finite fields, we create arithmeticcircuit-complexity lower bounds

Topics: Computer science
Publisher: eScholarship, University of California
Year: 2019
OAI identifier: oai:escholarship.org/ark:/13030/qt8tb0q56g
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://escholarship.org/uc/it... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles