Lance Fortnow Discusses Advances in Circuit Lower Bounds

External News Details
Media
  • Lance Fortnow compressed Lance Fortnow compressed
    (image/jpeg)

Lance Fortnow comments on a new breakthrough proof for computer science circuit complexity by theorists at Stanford University — calling it “the best progress in circuit lower bounds in nearly a quarter century.”

Additional Information

Groups

College of Computing, School of Computer Science

Categories
No categories were selected.
Keywords
Lance Fortnow; School of Computer Science; Quanta Magazine
Status
  • Created By: Tyler Sharp
  • Workflow Status: Published
  • Created On: Sep 29, 2015 - 9:17am
  • Last Updated: Oct 7, 2016 - 10:27pm