Skip to content
lectern.tv
Study notebook

Press N to jot a timestamped note or B to pin a moment while watching.

All Non-Trivial Variants of 3-LDT

B. DudekP. GawrychowskiUniversity of Wrocław

Professors

21:57·2020·research level·Research Seminar

A deep dive into the computational landscape of 3-local decision tree problems, dissecting all non-trivial variants to establish precise complexity bounds.

Theory & AlgosAlgorithms & Data StructuresComputational Complexityalgorithm analysislower bounds

Theory-Fest 2019-2020: Fine-Grained Complexity

Source: Computational Complexity via YouTubeWatch on YouTube
Lecturers (2)All lecturers →
B. Dudek

Professors

1 lectureCanon
P. Gawrychowski

Professors

1 lectureCanon

Comments

Add a comment...Sign in