Computing & Cybersecurity

Hamming codes part 2: The one-line implementation

Mes applications pour être plus productif | Rentrée 2020

My applications to be more productive | Back to school 2020

La révolution NoCode — Avec Thibault Marty (Ottho)

The NoCode revolution — With Thibault Marty (Ottho)

Petit test pépouze en VR.

Easy peasy little test in VR.

La révolution NoCode — Avec Alexis Kovalenko (Contournement)

[2020 TEIN/KOICA] Workshop for Vietnam (Intro + Session 1)

[2020 TEIN/KOICA] Workshop for Vietnam ( Session 3)

[2020 TEIN/KOICA] Summer Workshop for Vietnam ( Session 4)

[2020 TEIN/KOICA] Summer Workshop for Vietnam ( Session 2)

[2020 TEIN/KOICA] Summer Workshop for Vietnam ( Session 2)

[2020 TEIN/KOICA] Summer Workshop for Malaysia (Intro + Session 3)

QSI Seminar: Dr Peter Johnson, Zapata Computing, Minimising Estimation Runtime on Noisy Q.Computers.

[2020 TEIN/KOICA] Summer Workshop for Bangladesh (session 4)

[2020 TEIN/KOICA] Summer Workshop for Bangladesh ( session 3)

model validation

[2020 TEIN/KOICA] Summer Workshop for Indonesia (session 3)

Noisy Variational Quantum Algorithm Simulation lecture by Yipeng Huang

ERREURS Python : Comment les corriger FACILEMENT ?

Python ERRORS: How to Fix Them EASILY?

Airtable va révolutionner le NoCode avec cette feature (Août 2020)

Airtable is going to revolutionize NoCode with this feature (August 2020)

QSI Seminar: Dr Olivia Di Matteo, TRIUMF, Reading Between the Bitlines, 07/08/2020

5 Workflows Zapier pour gagner en productivité

5 Zapier Workflows to Boost Your Productivity

[Podcast] Yam of Tekna Search in Quantum London Podcast #2

Dinur's proof of the PCP Theorem: the Powering step || @ CMU || Lecture 27d of CS Theory Toolkit

Dinur's PCP: degree-reduction, expanderizing, mini-PCP || @ CMU || Lecture 27c of CS Theory Toolkit

Dinur's Proof of the PCP Theorem: outline || @ CMU || Lecture 27b of CS Theory Toolkit

Statement of the PCP Theorem || @ CMU || Lecture 27a of CS Theory Toolkit

NP-Hardness of Approximation || @ CMU || Lecture 26e of CS Theory Toolkit

Intuition on models and their complexity

Introduction To Pentesting - Enumeration

Exponential Time Hypotheses: ETH and SETH || @ CMU || Lecture 26d of CS Theory Toolkit

Hardness of Random 3XOR and 3Sat || @ CMU || Lecture 26c of CS Theory Toolkit

Computational Indistinguishability || @ CMU || Lecture 25b of CS Theory Toolkit

Information Complexity || @ CMU || Lecture 24c of CS Theory Toolkit

QSI Seminar: Ramis Movassagh, MIT-IBM Watson AI Lab, Cayley Path and Quantum Supremacy, 03/07/2020

Yao's Minimax Theorem & IP_2's Communication Complexity || @ CMU || Lecture 23d of CS Theory Toolkit

Randomized Communication Complexity || @ CMU || Lecture 23c of CS Theory Toolkit

QSI Seminar: Prof. Rodney Van Meter, Keio University, Engineering the Quantum Internet, 30/06/2020

Deterministic Communication Complexity || @ CMU || Lecture 23b of CS Theory Toolkit

Basics of Communication Complexity || @ CMU || Lecture 23a of CS Theory Toolkit

Great Ideas in Theoretical Computer Science: Introduction (Spring 2016) reupload with improved audio