专题：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.
最新文献
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints

article Full Text OpenAlex

The randomized query complexity of finding a Tarski fixed point on the Boolean hypercube

article Full Text OpenAlex

Impossibility Results for Weak Strategy-Proofness and Respect for Improvements in Random Assignment with Priorities 

preprint Full Text OpenAlex

LFD-PEKS: A Lightweight and Fast Dynamic Public-key Encryption with Keyword Search Scheme for multi-user environments

article Full Text OpenAlex

Complexity of Round-Robin Allocation with Potentially Noisy Queries

article Full Text OpenAlex

Optimal Pmu Placement Using Topology-Based Mixed-Integer Linear Programming: Improving Solution Quality Via Observability Distribution

preprint Full Text OpenAlex

Linear Planar 3-Sat and its Applications in Planning

preprint Full Text OpenAlex

Fingerprint-Based Secure Query Scheme for Databases over Symmetric Mirror Servers

article Full Text OpenAlex

Polynomial Threshold Functions of Bounded Tree-Width: Some Explainability and Complexity Aspects

book-chapter Full Text OpenAlex

NP-completeness by First-order and Quantifier-free Interpretations and Related Topics

book-chapter Full Text OpenAlex

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

article Full Text OpenAlex 236 FWCI28.888

Warm-starting quantum optimization

article Full Text OpenAlex 204 FWCI19.644

Indistinguishability obfuscation from well-founded assumptions

article Full Text OpenAlex 195 FWCI14.995

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

article Full Text OpenAlex 193 FWCI19.553

Algorithms and Complexity

book-chapter Full Text OpenAlex 137 FWCI4.703

Survey on Fully Homomorphic Encryption, Theory, and Applications

article Full Text OpenAlex 117 FWCI14.128

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

article Full Text OpenAlex 107 FWCI33.146

A (slightly) improved approximation algorithm for metric TSP

article Full Text OpenAlex 105 FWCI26.668

Algorithms: Design Techniques and Analysis

book Full Text OpenAlex 104 FWCI0.847

Formulating and Solving Routing Problems on Quantum Computers

article Full Text OpenAlex 104 FWCI10.543