Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- opinionJune 2024ONLINE FIRST
- opinionFebruary 2024
Verifying Correctness
Communications of the ACM (CACM), Volume 67, Issue 3March 2024, Pages 108–ffhttps://doi.org/10.1145/3639575Yael Tauman Kalai on her career, proof systems, and certifying correctness.
- opinionFebruary 2024
- research-articleFebruary 2024
Indistinguishability Obfuscation from Well-Founded Assumptions
Communications of the ACM (CACM), Volume 67, Issue 3March 2024, Pages 97–105https://doi.org/10.1145/3611095At least since the initial public proposal of public-key cryptography based on computational hardness conjectures, cryptographers have contemplated the possibility of a "one-way compiler" that translates computer programs into "incomprehensible" but ...
- opinionJanuary 2024
-
- research-articleJanuary 2024
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
Communications of the ACM (CACM), Volume 67, Issue 2February 2024, Pages 101–108https://doi.org/10.1145/3611094An Algebraic Circuit for a multivariate polynomial P is a computational model for constructing the polynomial P using only additions and multiplications. It is a syntactic model of computation, as opposed to the Boolean Circuit model, and hence lower ...
- research-articleNovember 2023
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
Communications of the ACM (CACM), Volume 66, Issue 12December 2023, Pages 85–92https://doi.org/10.1145/3610940We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m1+o(1) time. Our algorithm builds the flow through a sequence of m1+o(1)...
- articleJuly 2023
Computer-Assisted Proofs Take on Fluid Flow
Communications of the ACM (CACM), Volume 66, Issue 8August 2023, Pages 12–14https://doi.org/10.1145/3603745Researchers use computers to show that equations can "blow up."
- research-articleMay 2023
The Silent (R)evolution of SAT
Communications of the ACM (CACM), Volume 66, Issue 6June 2023, Pages 64–72https://doi.org/10.1145/3560469Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
- research-articleApril 2023
Toward Basing Cryptography on the Hardness of EXP
Communications of the ACM (CACM), Volume 66, Issue 5May 2023, Pages 91–99https://doi.org/10.1145/3587167Let Kt(x) denote the Levin-Kolmogorov Complexity of the string x, and let MKtP denote the language of pairs (x, k) having the property that Kt(x) ≤ k. We demonstrate that:
• MKtP ∉ HeurnegBPP (i.e., MKtP is two-sided error mildly average-case hard) iff ...
- articleJanuary 2023
Post-Quantum Cryptography
Communications of the ACM (CACM), Volume 66, Issue 2February 2023, Pages 15–17https://doi.org/10.1145/3575664Cryptographers seek algorithms quantum computers cannot break.
- articleDecember 2022
The Outlook for Crypto
Communications of the ACM (CACM), Volume 66, Issue 1January 2023, Pages 16–18https://doi.org/10.1145/3570520Can cryptocurrencies cut their environmental impact?
- research-articleMay 2022
- research-articleDecember 2021
Fifty years of P vs. NP and the possibility of the impossible
Communications of the ACM (CACM), Volume 65, Issue 1January 2022, Pages 76–85https://doi.org/10.1145/3460351Advances in algorithms, machine learning, and hardware can help tackle many NP-hard problems once thought impossible.
- research-articleOctober 2021
MIP* = RE
Communications of the ACM (CACM), Volume 64, Issue 11November 2021, Pages 131–138https://doi.org/10.1145/3485628Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in Communications is usually peer-reviewed prior to publication. The following paper is unusual in that it is still under review. However, the result has generated ...
- research-articleAugust 2021
Non-fungible tokens and the future of art
Communications of the ACM (CACM), Volume 64, Issue 9September 2021, Pages 19–20https://doi.org/10.1145/3474355A new blockchain-based technology is changing how the art world works, and changing how we think about asset ownership in the process.