Affordable Access

Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes

Authors
Publication Date
Source
Dagstuhl Research Online Publication Server
Keywords
  • Computational Complexity, Circuit Lower Bounds, Polynomial Identity Testing, Derandomization
  • Data Processing Computer Science
External links

Abstract

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments