PhDOpen: Wojciech Czerwiński
- Shared screen with speaker view
Michal
38:58
it’s OK!
Mateusz Banaszek
39:00
OK
Michał Zawalski
01:14:44
+1
Marek Sokołowski
01:14:45
+1
Wiktoria Kośny
01:14:45
+1
Konrad Majewski
01:14:48
+1
Mateusz Banaszek
01:14:49
Can you repeat since "Claim"?
Mateusz Banaszek
01:15:13
The last 2 lines
Mateusz Banaszek
01:17:58
Thank you.
Michał Zawalski
01:59:02
I have a technical question: what are the grading conditions?
Mateusz Banaszek
02:36:25
Is it something about repetitions? That with n=|Q| and {-1, 0, 1} if we get more than n^3, then we can reduce the path?
Mateusz Banaszek
02:42:01
Could you repeat what the "height" means?
Michal
02:53:30
thanks for ex 6!