Positive Almost-Sure Termination: Complexity and Proof Rules
Explore complexity and proof rules for Positive Almost-Sure Termination in probabilistic programming, including recursion-theoretic analysis and novel proof techniques using transfinite ordinals.
The Complex(ity) Landscape of Checking Infinite Descent
Explore the complexity of checking Infinite Descent in cyclic proof systems, examining various criteria and their parameterized time complexities to improve automatic verification techniques.
Efficient Construction of Rigid Matrices Using an NP Oracle
Explore matrix rigidity, its applications in communication complexity and circuit lower bounds, and innovative algorithmic approaches for constructing rigid matrices.
Hardness Magnification for All Sparse NP Languages
Explore hardness magnification in computational complexity, focusing on sparse NP languages and the Minimum Circuit Size Problem, with insights on algorithms and open challenges.
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
Explore average-case complexity of counting cliques in Erdos-Renyi hypergraphs, covering proof techniques, random KQ accounting, and binary expansions.
Local Proofs Approaching the Witness Length
Explore probabilistically checkable proofs, interactive oracle proofs, and tensor codes in this talk on local proofs and witness length optimization.
New Techniques for Proving Fine-Grained Average-Case Hardness
Explore cutting-edge methods for demonstrating fine-grained average-case complexity, focusing on K-Click problems and factored approaches in computational theory.
Is it Easier to Prove Statements that are Guaranteed to be True?
Explore the intricacies of proving statements in computational complexity, focusing on worst-case vs. average-case hardness and the challenges in NP-Search problems.
Extractors and Secret Sharing Against Bounded Collusion Protocols
Explore complexity theory, multiparty communication, and leakage-resilient extractors in this talk on bounded collusion protocols and secret sharing techniques.
Nearly Optimal Pseudorandomness From Hardness
Explore cutting-edge pseudorandomness techniques derived from computational hardness, focusing on novel approaches using codes with large alphabets and pseudoentropy extraction.
Smoothing the Gap Between NP and ER
Explore the relationship between NP and ER problems through smooth analysis, examining key results and applications in recognition problems.
A Dichotomy for Real Boolean Holant Problems
Explore the complexity classification of real-valued Boolean Holant problems, focusing on tractable signatures, gadget construction, and induction proofs for a comprehensive dichotomy theorem.
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
Explore the relationship between worst-case meta-complexity and average-case complexity in PH, examining key concepts and open questions in computational complexity theory.
Remember When We Broke the Internet
Exploring unexpected incidents in open source history, their impact on technology, and the complexity of open source ecosystems as sociotechnical systems.
Simplicity & Complexity - The Beauty & the Beast
Explore the tension between simplicity and complexity in software development, discussing strategies to reduce complexity and create more effective solutions.
Who Controls the World?
Explore complexity theory's insights into global economic control, revealing how power concentration in few hands impacts us all.
Password Hashing - The Future is Now
Explore the future of password hashing, its challenges, and the Password Hashing Competition initiative to develop improved methods for securing digital systems.
Extended Tower Number Field Sieve - A New Complexity for the Medium Prime Case
Explore an advanced cryptographic algorithm for factoring medium-sized prime numbers, offering insights into its complexity and potential applications in number theory and cryptography.
On the Existence of Three Round Zero-Knowledge Proofs
Explore the intricacies of three-round zero-knowledge proofs, delving into complexity, compression, and verification methods in cryptography.
A Fine Grained Approach to Complexity
Explore a nuanced perspective on computational complexity, delving into fine-grained approaches and their implications for algorithm design and problem-solving.
How Hard Can It Be! Practical Uses of Complexity Theory
Explore practical applications of complexity theory in software development, focusing on algorithmic efficiency and problem-solving strategies for real-world scenarios.