Deep dive: A generalized Sylvester-Gallai type theorem for quadratic polynomials - Shir Peleg

Why it's on BrighterTube

Editorial review · 85% confidence

Whole-channel inclusion: Computational Complexity Conference (title sample: This is a recorded academic conference channel where nearly every upload is a full technical research talk on computational complexity theory, clearly educational primary-source content.; 0 of 3 sampled transcripts read as real teaching); this title passed a strict title check.

What you'll learn

A 28-minute video from Computational Complexity Conference: “Deep dive: A generalized Sylvester-Gallai type theorem for quadratic polynomials - Shir Peleg”.

Video by Computational Complexity Conference, played through YouTube's embedded player.

Videos are embedded from YouTube and belong to their creators. BrighterTube isn't affiliated with YouTube or Google.

As an Amazon Associate, BrighterTube earns from qualifying purchases.

© 2026 BrighterTube