Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Derandomization

Showing: 17 courses
Institute for Advanced Study

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen

0 rewiews
Explore advanced topics in computational complexity, including circuit lower bounds, derandomization, and their connections. Gain insights into cutting-edge research and theoretical developments in computer science.
Add to list
14 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Simons Institute

Tales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy

0 rewiews
Explores obfuscation's role in theoretical computer science, covering Circuit Range Avoidance, metacomplexity of Kolmogorov complexity, and computational differential privacy, with focus on recent results and open questions.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
Ryan O'Donnell

Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit

0 rewiews
Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.
Add to list
17 Lesons
23 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization

0 rewiews
Explore circuit lower bounds and derandomization, focusing on AC circuits, algorithmic methods, and pseudorandom generators. Learn about recent developments in average-case circuit analysis.
Add to list
16 Lesons
21 minutes
On-Demand
Free-Video
Simons Institute

Derandomization: A Quick Tutorial

0 rewiews
Explore efficient methods for transforming interactive protocols into NP-type verifiers, using targeted pseudorandom generators and complexity-theoretic assumptions.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
IEEE

Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization

0 rewiews
Explore groundbreaking research on circuit complexity theory, focusing on the connection between derandomization techniques and establishing lower bounds for circuit sizes across various computational models.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
IEEE

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds

0 rewiews
Explore connections between computational complexity theories, focusing on exponential-time hypotheses, derandomization techniques, and circuit lower bounds in theoretical computer science.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
Simons Institute

Coding Theory in Almost Linear Time and Sublinear Space

0 rewiews
Explore efficient error-correcting codes with near-linear time and sub-linear space encoding/decoding algorithms. Learn about innovative techniques in hashing, locally correctable codes, and derandomization.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
IEEE

Polynomial Data Structure Lower Bounds in the Group Model

0 rewiews
Explore polynomial data structure lower bounds in the group model, covering static structures, lower bounds, models, and efficiency concepts. Insights on k-wise independence and derandomization.
Add to list
10 Lesons
25 minutes
On-Demand
Free-Video
IEEE

Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization

0 rewiews
Explore deterministic distributed algorithms for expander decompositions and routing, with applications in derandomization. Learn about balanced sparse cut algorithms and recursive techniques.
Add to list
9 Lesons
23 minutes
On-Demand
Free-Video
IEEE

High-Precision Estimation of Random Walks in Small Space

0 rewiews
Explore advanced techniques for estimating random walks in limited space, covering pseudorandom generators, graph algorithms, and Laplacian systems for efficient problem-solving.
Add to list
12 Lesons
25 minutes
On-Demand
Free-Video
IEEE

Nearly Optimal Pseudorandomness From Hardness

0 rewiews
Explore cutting-edge pseudorandomness techniques derived from computational hardness, focusing on novel approaches using codes with large alphabets and pseudoentropy extraction.
Add to list
14 Lesons
26 minutes
On-Demand
Free-Video
TheIACR

A Note on Perfect Correctness by Derandomization

0 rewiews
Explore derandomization techniques for achieving perfect correctness in cryptographic schemes, focusing on public-key encryption and the concept of cryptographic strings.
Add to list
15 Lesons
22 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Derandomization and Meta-complexity - Part 2

0 rewiews
Explore meta-complexity in derandomization through an advanced tutorial. Delve into cutting-edge mathematical concepts and their applications in randomness and complexity theory.
Add to list
1 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Pseudodeterministic Constructions and rK^t - Tutorial 3

0 rewiews
Explore pseudodeterministic constructions and rK^t in this advanced mathematics tutorial by Igor Carboni Oliveira, delving into randomness, information, and complexity theory.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Derandomization: Pseudo-randomness from Hardness - Part 1

0 rewiews
Explore pseudo-randomness from hardness in derandomization with Valentine Kabanets. Gain insights into this mathematical concept through a comprehensive tutorial.
Add to list
1 Lesons
1 hour 15 minutes
On-Demand
Free-Video
Institute for Advanced Study

Concentration on HDX: Derandomization Beyond Chernoff - Lecture

0 rewiews
Explore advanced derandomization techniques beyond Chernoff's bound, focusing on high-dimensional expanders and their applications in theoretical computer science and complexity theory.
Add to list
1 Lesons
2 hours 8 minutes
On-Demand
Free-Video