curius graph

all pages

showing 81401-81450 of 203147 pages (sorted by popularity)
[2305.16971] Theoretical and Practical Perspectives on what Influence Functions Do
[2401.10095] Learning shallow quantum circuits
Jonathan Manton's Blog | Thoughts and ideas on mathematics, engineering, neuroscience and academia
[2411.04551] Measure-to-measure interpolation using Transformers
Analytical Methods in Computer Science
Real Analysis in Computer Science: A collection of Open Problems
CSE 291 - Fourier analysis of boolean functions
NONCOMMUTATIVE MAJORIZATION PRINCIPLES AND GROTHENDIECK’S INEQUALITY
CS252: Analysis of Boolean Functions
barbados-aobf-lecture-notes.pdf
COMP 760 (Winter 2014): Harmonic Analysis of Boolean Functions
Great Theory Hits - HackMD
Great Theory Hits - HackMD
Teaching - Raghu Meka
Piyush Srivastava - Polynomials reading group
Piyush Srivastava - Topics in the study of Markov chains
Piyush Srivastava - Polynomials and applications
Algebra, Number Theory and Computation
Ramprasad Saptharishi - Ramprasad Saptharishi
Prahladh Harsha - Teaching
Fall 2022: IT for CS
Sumegha Garg - COS540 (Fall 2023, Rutgers)
Avishay Tal - STOC 2020 Workshop: Derandomizing Space-Bounded Computation
Billingsley Convergence of Probability MEASURES
lec10.pdf 15-854: Approximations Algorithms
Approximation Algorithms and Hardness of Approximation
15-854 Approximation Algorithms, Fall 2005
Algorithms and Complexity (Freiburg)
approx-algorithms-lecture-notes.pdf
Arash Asadpour: NYU Stern
cs.dartmouth.edu/~deepc/appx-lecture-notes.htm
[2403.12350] Friendly Sharpness-Aware Minimization
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization | SIAM Journal on Optimization
Videos
[2401.04683] Castelnuovo-Mumford regularity of the closed neighborhood ideal of a graph
Algebraic and Combinatorial Methods in Computational Complexity
Polynomial Identity Testing: Derandomization Results and Applications to Algebraic Computation - ProQuest
Marco Avella Medina - Lecture notes for G5703
Tristan Ozuch
cc.complexity theory - Start learning proof complexity - Theoretical Computer Science Stack Exchange
CMSC 39600-1: Propositional Proof Complexity (Topics in Theoretical Computer Science)
Graph Partitioning and Expanders | Stanford University | NovoEd
[Theory-reading] generalization of Hastad-Wigderson
Computational Properties of Prediction Markets
WACT 2016: Home
Web Page of Amir Shpilka
New correlation bounds for GF(2) polynomials using Gowers uniformity
The Coppersmith-Winograd Matrix Multiplication Algorithm
Earliest Connections of Additive Combinatorics and Computer Science | in theory
Add Comb