Rejewski, Różycki, Zygalski
-
Rejewski, Różycki, Zygalski lectures 2020
Date: thursday, 17.12.2020,10:00 Speaker: prof. Günter M. Ziegler Title: Semi-algebraic sets of integer pointsAbstract: We look at sets of integer points in the plane, and discuss possible definitions of when such a set is "complicated": One interesting criterion is whether it is the set of integer solutions to some system ...
17.12.202017.12 -
Rejewski, Różycki, Zygalski lectures 2018
Date: thursday, 25.01.2018, 11:00 Speaker: dr Marek Grajek Title: The Enigma Relay. A Discovered Report of Polish Cryptologists.Abstract: The secret of Enigma has never been Clio's favorite. The first Allied accounts from the meeting in Pyry were dictated by emotions rather than by concern for the truth. Post-war reports on ...
25.01.201825.01 -
Rejewski, Różycki, Zygalski lectures 2017
Date: wednesday, 24.05.2017, 15:30 Speaker: prof. Christos H. Papadimitriou Title: A computer scientist thinks about the brain Abstract: During the past two decades, computer scientists ventured beyond the study of the computer and its capabilities and limitations, to reach for a computational understanding of the Internet. Arguably, this has transformed ...
24.05.201724.05 -
Rejewski, Różycki, Zygalski lectures 2016
Date: tuesday, 24.05.2016,15:30 Speaker: Sir John Dermot Turing Titile: Alan Turing and the Enigma Abstract: In January 1940 Alan Turing was sent to Paris to exchange vital knowhow with the Polish codebreakers, then working in exile for French intelligence. What was Alan Turing’s role in the breaking of Enigma? To ...
24.05.201624.05 -
Rejewski, Różycki, Zygalski lectures 2015
Date: thursday, 26.03.2015, 15:30 Speaker: prof. Gil Kalai Title: What can we learn from a failure of quantum computers Abstract: Quantum computers are hypothetical devices that enable us to perform certain computations hundreds of magnitude of order faster than digital computers. This feature, coined “quantum supremacy”, could be manifested by ...
26.03.201526.03 -
Rejewski, Różycki, Zygalski lectures 2014
Date: thursday, 06.11.2014, 15:30 Speaker: prof. Noga Alon Title: Voting Paradoxes Abstract: The early work of Condorcet in the 18th century, and that of Arrow and others in the 20th century, revealed the complex and interesting mathematical problems that arise in the theory of Social Choice, showing that the simple ...
6.11.201406.11 -
Rejewski, Różycki, Zygalski lectures 2012
Date: thursday, 29.11.2012, 15:30 Speaker: prof. Johan Håstad Title: Lazy verification of proofs and hard problems Abstract: Verifying a proof is often a tedious task requiring the verifier to read the entire proof and check each step. In this talk we discuss Probabilistically Checkable Proofs (PCPs) which can be verified ...
29.11.201229.11 -
Rejewski, Różycki, Zygalski lectures 2011
Date: thursday, 10.11.2011, 15:30 Speaker: prof. Shafi Goldwasser Title: Secrets and Proofs: The Role of Randomness Abstract: Secrecy, which lays at the heart of cryptography, is an ancient art. This art form has been transformed into a science in the last 30 years, using the tools and esthetics of computational ...
10.11.201110.11 -
Rejewski, Różycki, Zygalski lectures, 2009
Date: friday, 19.06.2009, 11:00 Speaker: prof. Avi Wigderson Title: Randomness - a computational complexity viewAbstract: Man has grappled with the meaning and utility of randomness for centuries. Research in the Theory of Computation in the last thirty years has enriched this study considerably. I'll describe two main aspects of this ...
19.06.201119.06 -
Rejewski, Różycki, Zygalski lectures 2010
Date: friday, 28.05.2010, 11:00 Speaker: prof. Emo Welzl Title: When Conflicting Constraints Can be Resolved - the Local Lemma and Satisfiability Abstract: The general theme underlying the talk is the following question: Given a set of constraints, how much interleaving of these constraints (relative to how serious these constraints are) ...
28.05.201128.05