专题：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.
最新文献
An Auditable Transcript-to-Notebook Pipeline with Completion-Mass Capacity Bounds (Within-Model Results)

preprint Full Text OpenAlex

EA ( 𝑡 , 𝑟 ) (t,r) An_Adversarial_Extendibility_Measure_and_Lower_Bound_Program_Note

preprint Full Text OpenAlex

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

article Full Text OpenAlex

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

article Full Text OpenAlex

Overcomplete Tensor Decomposition via Koszul-Young Flattenings

article Full Text OpenAlex

A quadtree, a Steiner spanner, and approximate nearest neighbours in hyperbolic space

article Full Text OpenAlex

Equivalence Between Integers and Network Structure

preprint Full Text OpenAlex

Long Arithmetic Progressions in Sparse Subset Sums: A Computational Perspective

book-chapter Full Text OpenAlex

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration

book-chapter Full Text OpenAlex

Characterizations of certain matroids by maximizing valuative invariants

article Full Text OpenAlex

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

article Full Text OpenAlex 353 FWCI45.8551

Survey on Fully Homomorphic Encryption, Theory, and Applications

article Full Text OpenAlex 222 FWCI28.2502

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

article Full Text OpenAlex 218 FWCI25.385

BTS

article Full Text OpenAlex 147 FWCI18.0687

Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm

article Full Text OpenAlex 127 FWCI15.1631

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

article Full Text OpenAlex 126 FWCI26.144

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

article Full Text OpenAlex 108 FWCI12.1468

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

article Full Text OpenAlex 107 FWCI18.5686

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

book-chapter Full Text OpenAlex 101 FWCI32.9161

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

book-chapter Full Text OpenAlex 101 FWCI53.7895