专题：Combinatorial Optimization and Complexity Theory

This cluster of papers focuses on combinatorial optimization, approximation algorithms, complexity theory, graph algorithms, submodular functions, network flows, matrix multiplication, communication complexity, linear programming, and algorithmic applications.
最新文献
Addendum 11: Rigorous 1‑RSB Condensation for Canonical 3‑SAT (Extension of the Nam–Sly–Sohn Proof via Poisson Cloning, p‑Biased Fourier Analysis, and Guerra–Toninelli Interpolation)

preprint Full Text OpenAlex

CFP-MCFP Complete Theorem Proofs: 85 Slides with Full Proof Details

article Full Text OpenAlex

The OGP as an Informational Filter: Experimental Evidence for a Universal Binary Barrier in NP‑Complete Problems

preprint Full Text OpenAlex

Recognition of k-Distance Monotone Boolean Functions

article Full Text OpenAlex

Concise Theoretical and Algorithmic Notes on Reachability Queries in Multilayer Graphs

article Full Text OpenAlex

One Axiom : The Geometry of Quantum Search

article Full Text OpenAlex

Approximating Univariate Factored Distributions via Message-Passing Algorithms

article Full Text OpenAlex

Accelerated Sinkhorn Algorithms for Partial Optimal Transport

article Full Text OpenAlex

Quantifier Elimination Meets Treewidth

book-chapter Full Text OpenAlex

QUBO Formulations and Quantum Optimization for the Multi-Dimensional Knapsack Problem With Conflict, Forcing, and Precedence Constraints

article Full Text OpenAlex

近5年高被引文献
Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network

article Full Text OpenAlex 362 FWCI46.5214

Survey on Fully Homomorphic Encryption, Theory, and Applications

article Full Text OpenAlex 238 FWCI28.746

The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size

article Full Text OpenAlex 229 FWCI25.5527

BTS

article Full Text OpenAlex 153 FWCI18.5794

Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm

article Full Text OpenAlex 136 FWCI15.5534

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

article Full Text OpenAlex 128 FWCI25.991

FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic Encryption

article Full Text OpenAlex 113 FWCI18.8137

Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates

article Full Text OpenAlex 111 FWCI11.9641

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General

book-chapter Full Text OpenAlex 103 FWCI32.7638

HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates

book-chapter Full Text OpenAlex 103 FWCI52.8914