Recent work has combined pseudorandom starting structures and random techniques that use the framework of finite geometry.
Theory
Advertisement
What Is Theoretical Computer Science?
As computer scientists, we should look for inspiration from physics rather than from mathematics.
What should you bet to maximize your probability of doubling your money in a scenario where you are willing to lose all your money?
A paper by Victor Reis and Thomas Rothvoss proved a new upper bound on the time required to solve for any integer program.
The most popular explainable AI (XAI) approaches offer no guarantees of rigor.
Solving Sparse Linear Systems Faster than Matrix Multiplication
In this paper, we present an algorithm that solves linear systems with sparse coefficient matrices asymptotically faster than matrix multiplication for any ω > 2.
Technical Perspective: Solve for x
Peng and Vempala have pushed through a barrier that has stood for decades. How far will their momentum carry us?
Maybe the formalization of the tech imperative fails because it's not really about the implications of propositional logic.
Wigderson Named Turing Awardee for Decisive Work on Randomness
His groundbreaking contributions to theoretical computer science demonstrate the power and limitations of randomness in computation.
Biocomputation: Moving Beyond Turing with Living Cellular Computers
The information processing link between computer science and molecular biology.
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems
The challenge of transforming polynomialtime algorithms to really efficient ones.
Indistinguishability Obfuscation from Well-Founded Assumptions
We examine a formalization of the “one-way compiler" concept with the notion of indistinguishability obfuscation.
Technical Perspective: Hiding Secrets in Programs
"Indistinguishability Obfuscation from Well-Founded Assumptions," by Aayush Jain et al., gives a new construction of indistinguishability obfuscation that is provably secure.
A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in Databases
Deploying possible world semantics and the challenge of computing the certain answers to queries.
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
In this paper, we prove the first superpolynomial lower bounds against algebraic circuits of all constant depths over all fields of characteristic 0.
Technical Perspective: How Easy Is It to Describe Hard Polynomials?
"Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits," by Nutan Limaye et al., achieves a landmark in the larger quest of understanding hardness, dentity testing, and reconstruction.
What Should We Do when Our Ideas of Fairness Conflict?
Standards for fair decision making could help us develop algorithms that comport with our consensus views; however, algorithmic fairness has its limits.
Theoretical Analysis of Edit Distance Algorithms
To what extent have the techniques for theoretical analysis of edit distance algorithms achieved their goals?
Cook-Levin: The Ugly Underbelly is Good for Us
Don't just tell your students that SAT is NP-Complete; show why.
Emulating the behavior of exotic quantum states may give quantum computing a better way of squeezing out troublesome noise and errors.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More