专题：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.
最新文献
Random Signs into Matchings: A Godsil-Gutman Identity, Formalized in Lean 4 (Part I)

article Full Text OpenAlex

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

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

Hierarchical granular-ball graph pooling via feature–structure coupling

article Full Text OpenAlex

The Grover Dilemma and Three Fundamental Barriers to Oracle-Based Quantum Search Algorithms

article Full Text OpenAlex

Counting cliques with prescribed intersection sizes

article Full Text OpenAlex

On the Impossibility of SNARGs with Short CRS : (or: Revisiting Gentry-Wichs Barrier in the Non-adaptive Setting)

article Full Text OpenAlex

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)

article Full Text OpenAlex

Stronger Cell Probe Lower Bounds via Local PRGs

article Full Text OpenAlex

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

article Full Text OpenAlex 376 FWCI46.4853

Survey on Fully Homomorphic Encryption, Theory, and Applications

article Full Text OpenAlex 254 FWCI28.8644

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

article Full Text OpenAlex 234 FWCI25.5332

BTS

article Full Text OpenAlex 159 FWCI18.5941

Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm

article Full Text OpenAlex 141 FWCI15.6766

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

article Full Text OpenAlex 132 FWCI25.913

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

article Full Text OpenAlex 115 FWCI18.3018

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

article Full Text OpenAlex 114 FWCI11.9448

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

book-chapter Full Text OpenAlex 112 FWCI56.1156

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

book-chapter Full Text OpenAlex 110 FWCI32.7421