'St connectivity' diaporamas de présentation

Jeff Edmonds York University

4111 Computability. Complexity Classes. Computable Halting Acceptable, Witness, Enumerable Computable Ackermann's Time Double Exponential Time E: Exponential Time Exp Time PSpace PH: Poly-Time Hierarchy NP & Co-NP. Poly-Time NC: Poly-log depth Circuits NC2 NL: Non- Det Log Space

953 views • 79 slides

Undirected ST-Connectivity In Log Space

Undirected ST-Connectivity In Log Space. Omer Reingold Slides by Sharon Bruckner. Today. Some history What are we adding to the mix? Connectivity in expanders Making expanders: powering it up and cutting it down Putting it together in Log-Space In conclusion. What is ST-Connectivity?.

616 views • 52 slides

Undirected ST-Connectivity In Log Space

Undirected ST-Connectivity In Log Space. Omer Reingold Slides by Sharon Bruckner. Today. Some history What are we adding to the mix? Connectivity in expanders Making expanders: powering it up and cutting it down Putting it together in Log-Space In conclusion. Some History.

574 views • 44 slides

Undirected ST-Connectivity in Log-Space

313 views • 18 slides

Almost SL=L , and Near-Perfect Derandomization

Almost SL=L , and Near-Perfect Derandomization. Oded Goldreich The Weizmann Institute Avi Wigderson IAS, Princeton Hebrew University. SL vs. L. Theseus. Ariadne. Crete, ~1000 BC. SL vs L. Thm (informal): SL=L except on rare inputs.

249 views • 17 slides