SNARKs for C - Verifying Program Executions Succinctly and in Zero Knowledge
Explore succinct non-interactive arguments of knowledge (SNARKs) for verifying program executions, focusing on TinyRAM architecture and concrete efficiency improvements.
Information, Computation, Optimization - Connecting the Dots in the Traveling Salesman Problem
Explore optimization techniques and their applications in solving complex problems like the Traveling Salesman, with insights from William Cook's research and real-world examples.
Rendering Mona Lisa by Solving the Traveling Salesman Problem
Explore how JavaScript tackles the Traveling Salesman Problem to create a unique rendition of the Mona Lisa, blending art, algorithms, and computational challenges.
Quantum-Inspired Annealing: The State of Play
Explore quantum-inspired annealing's current state, comparing quantum and classical approaches, and examining benchmarks for various optimization problems.
Classic Problems with Modern Techniques - Prize-collecting Framework
Explore state-of-the-art approximation algorithms for classic network design problems using modern techniques, from clustering to recursive methodologies.
Quantum Algorithms for Search and Optimization
Explore quantum algorithms for search and optimization, including recent advancements in random walk speedups, NP-complete problem improvements, and geometric problem solutions.