1 / 14

Depth-?. Threshold Circuits vs. Depth-?.+.1 AND-OR Trees STOC 2023

Bounded-depth circuit models like AC0 and TC0 circuits are compared, discussing linear threshold functions, circuit analysis algorithms, circuit lower bounds, graph algorithms, and more. The limitations of depth reduction and explicit circuit complexity are explored, with a focus on TC0 circuit lower bounds and hard functions in AC0. The complexity of monotone read-once AC0 formulas is also analyzed, along with the proof involving random restrictions.

petriz
Télécharger la présentation

Depth-?. Threshold Circuits vs. Depth-?.+.1 AND-OR Trees STOC 2023

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

More Related