Channel Avatar

WACT 2016 @UCSI4OQSGT0gEEehjKSDvLag@youtube.com

86 subscribers - no pronouns :c

Lectures from the 4th Workshop on Algebraic Complexity Theor


54:26
Rohit Gurjar: Bipartite matching is in quasi-NC - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
46:27
Rohit Gurjar: Bipartite matching is in quasi-NC - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
43:31
Ben Lee Volk: Identity testing and lower bounds for read-k oblivious ABPs
58:38
Neeraj Kayal: An almost cubic lower bound for depth three arithmetic circuits
47:09
Ramprasad Saptharishi: Functional lower bounds for depth-4 circuits and connections to ACC
55:24
Amir Yehudayoff: Computing with Symmetries - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
01:12:39
Ankit Gupta: Alg. geom. techniques for depth-4 PIT and Sylvester-Gallai conjectures for varieties
50:28
Mrinal Kumar: Lower bounds for homogeneous depth-5 circuits over small finite fields
46:54
K V Subrahmanyam: Invariants of several matrices under SL(n) x SL(n) action
01:02:25
Ankit Garg: A deterministic poly time algorithm for rational identity testing
01:05:51
Rafael Oliveira: Factors of polynomials of low individual degree - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
01:06:44
Nitin Saxena: Identity testing for constant-width, and commutative, ROABPs
51:26
Arpita Korwar: Identity testing for sums of ROABPs - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
33:10
Parikshit Gopalan: Pseudorandomness against bounded memory III - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
42:06
Parikshit Gopalan: Pseudorandomness against bounded memory II - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
46:41
Parikshit Gopalan: Pseudorandomness against bounded memory I
48:03
Michael Forbes: Proof Complexity Lower Bounds from Algebraic Circuit Complexity
49:58
Iddo Tzameret: Characterizing Propositional Proofs as Non-commutative Formulas
54:58
Pavel Hrubeลก: Arithmetic Circuits and Proof Complexity II - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
54:30
Pavel Hrubeลก: Arithmetic Circuits and Proof Complexity I - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
59:19
Toniann Pitassi: Proof Complexity Tutorial II - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
01:01:00
Toniann Pitassi: Proof Complexity Tutorial I - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
35:09
Ramprasad Saptharishi: Depth Reduction I
58:08
Christian Ikenmeyer: Rectangular Kronecker coefficients and plethysms in GCT
51:03
Amir Shpilka: Introduction II
58:20
Michael Forbes: Some Concrete Questions on the Border Complexity of Polynomials
57:25
Chandan Saha: Shifted Partial Derivatives II - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
55:56
Chandan Saha: Shifted Partial Derivatives I - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
59:25
Michael Forbes: Translation and Rank Concentration - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
51:38
Michael Forbes: Towards PIT for ROABPs - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
47:34
Michael Forbes: Basic PITs - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
51:31
Michael Forbes: Lower bounds and PIT
47:04
Ramprasad Saptharishi: Partial Derivative Method II - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
44:13
Ramprasad Saptharishi: Partial Derivative Method I
42:33
Amir Shpilka: Basic Lower Bounds
51:25
Ramprasad Saptharishi: Structural Results II
48:20
Amir Shpilka: Structural Results I
54:25
Ankit Gupta: Depth Reduction II - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
48:05
Amir Shpilka: Introduction I
59:27
Ketan Mulmuley: Efficient Noether Normalization via GCT III - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
47:00
Ketan Mulmuley: Efficient Noether Normalization via GCT II - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™
51:36
Ketan Mulmuley: Efficient Noether Normalization via GCT I - ืฆื™ืœื•ื ื”ืจืฆืื•ืช ืกื˜ื•ื“ื™ื• ื”ืื ื” ื‘ื™