Provably Efficient Quantum Algorithms for Nonlinear Dynamics and Machine Learning
Explore quantum algorithms for nonlinear dynamics and machine learning, including efficient solutions for differential equations and training sparse neural networks with potential quantum enhancements.
Multiset Arithmetic via Trees - Math Foundations 230
Explore multiset arithmetic using rooted trees, offering a visual representation for counting functions and new arithmetic operations. Gain insights into this alternative approach with concrete examples and useful notations.
Practical Aspects of Modern Cryptography - Lecture 6
Explore practical aspects of modern cryptography, delving into advanced techniques and real-world applications for secure communication and data protection.
Practical Aspects of Modern Cryptography - Lecture 3
Explore practical aspects of modern cryptography, including key concepts, algorithms, and real-world applications in secure communication and data protection.
PLSE Seminar Series - The Power of Symbolic Automata
Explores symbolic automata, their applications in program verification, and novel decision procedures for equivalence checking and minimization of these powerful automata operating over infinite alphabets.
Statistical Applications of Wasserstein Gradient Flows
Explore statistical applications of Wasserstein gradient flows in optimal transport, covering Otto calculus, Riemannian structures, and applications to variational inference and Gaussian mixture models.
The Asynchronous Computability Theorem - Distributed Systems and Algebraic Topology
Explore the connection between distributed systems protocols and algebraic topology, proving consensus impossibility in asynchronous wait-free models through combinatorial structures.
Sublinear Time Property Testers - Algorithms for Efficient Function Analysis
Explore sublinear time property testers for efficient algorithm design. Learn about relaxed decision problems, fast testers, and applications in graph theory and string processing.
Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
Explore advanced algorithms for graph reachability and distance problems, focusing on fine-grained complexity analysis and innovative design techniques.
Ubuntu Online Summit 15.11 Track Summaries
Resumen de las principales conclusiones y resultados de los diferentes temas tratados en la Cumbre en línea de Ubuntu 15.11, presentado por los líderes de cada área.
Learning from Dependent Data - Lecture 1
Explore techniques for learning from dependent data, focusing on probabilistic and optimization methods in data science. Gain insights into handling interconnected information effectively.
Quantum Constructions and Proofs - Session 193
Explore quantum constructions and proofs, delving into advanced concepts and methodologies in quantum computing and cryptography.
Isogenies and Lattices in Cryptography - Session 12
Explore isogenies and lattices in cryptography, covering twin smooth integers, polynomials, delayed encryption, sealed bid auctions, and lattice-based techniques for enhanced security.
A Decade of Fully Homomorphic Encryption - Past, Present and Future
Comprehensive overview of fully homomorphic encryption's evolution, exploring its journey from concept to practical tool, examining various schemes, and discussing future directions in the field.
Linear Layers in Cryptography - Session from Fast Software Encryption 2023
Explore field structures, linear layers, and matrix decompositions in cryptography. Learn about evolutionary matrices and their applications in software encryption.
Differential Trail Search and Bounds in Cryptography - Session 2
Explore differential trail search and bounds in cryptography, covering basic notions, permutations, score functions, and recent advancements in the field.
Isogenies in Public Key Cryptography - PKC 2023 Session
Explore cutting-edge research on isogenies in cryptography, featuring presentations on recent advancements and potential applications in post-quantum security.
High-Dimensional Sipser-Spielman Codes - IPAM at UCLA
Exploration of high-dimensional Sipser-Spielman codes, extending expander codes to cell complexes and cellular sheaves, with applications in quantum error correction and coding theory.
Entanglement of Sections - IPAM at UCLA
Explore quantum information in parameter families through examples, presented by Microsoft Research's Michael Freedman at IPAM's workshop on topology and quantum error correction.
Quantum Error Correcting for Gravity in the Large-N Limit - IPAM at UCLA
Explore quantum error correcting codes for large-N limit theories, focusing on gravitational duals and emerging features. Covers asymptotic operator algebra results and information theoretic constraints.
A New Case of BSD Conjecture and Deformation of Line Bundles
Explores a new case of the BSD conjecture for elliptic curves and examines deformation of line bundles in positive and mixed characteristic, applying rigidity properties of variations of Hodge structures.