DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» APX
APX
Advanced Complexity Theory
APX Radio Family Brochure
The Complexity Zoo
MODULES and ITS REVERSES 1. Introduction the Hölder Inequality
User's Guide for Complexity: a LATEX Package, Version 0.80
Approximation Hardness of Optimization Problems in Intersection Graphs of D-Dimensional Boxes
Maximum Clique in Disk-Like Intersection Graphs
The Trichotomy of HAVING Queries on a Probabilistic Database
Another Problem with Variants on Either Side of P Vs. NP Divide
Quantum Complexity Theory
Class on Algorithmic Lower Bounds and Hardness Proofs, Lecture 11
Master's Thesis
A Survey on the Structure of Approximation Classes
Theoretical Computer Science Hard Constraint Satisfaction
Algorithms and Hardness Results for Some Valued Csps
P Vs. NP: Geometric Approaches
Random Generation and Approximate Counting of Combinatorial Structures
Class on Algorithmic Lower Bounds and Hardness Proofs, Lecture 10
Top View
Scribe Notes
Probabilistic Checking of Proofs and Hardness of Approximation Problems
Class on Algorithmic Lower Bounds and Hardness Proofs, Lecture 1
Algorithms Outline the Class
Some Reverses of Hölder Vector Operator Inequality
On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
The Computational Complexity of Some Games and Puzzles with Theoretical Applications
APX 8000 Model III Quick Reference Guide
On the Hardness of Approximating Minimum Vertex Cover
The Longest Run Subsequence Problem: Further Complexity Results
Fundamentals of Optimization Problems
Approximability of Optimization Problems Within an Approach of Quantum Computing
Problem Analysis and Complexity Theory SS16
A Structural View of Approximation
The Complexity of Translationally Invariant Problems Beyond Ground
Some APX-Completeness Results for Cubic Graphs
Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗
NIZK from LPN and Trapdoor Hash Via Correlation Intractability for Approximable Relations
APX 1000 III Quick Reference Card
On Some General Inequalities Related to Operator AM-GM Inequality
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation (Extended Abstract)
Probabilistically Checkable Proofs and Expander Graphs
Conic Linear Programming
Models and Algorithms for Metabolic Networks: Elementary Modes and Precursor Sets Vicente Acuña
Completeness in Approximation Classes Beyond APX Bruno Escoffier, Vangelis Paschos
A Complementary Inequality to the Information Monotonicity for Tsallis
Proof Verification and the Hardness of Approximation Problems
Scribe Notes
An Overview on Polynomial Approximation of NP-Hard Problems Vangelis Paschos
Approximation Algorithms
Lipics-ITCS-2020-62.Pdf (1
Problem Analysis and Complexity Theory Summer Term 2020
Structure in Approximation Classes?
The Complexity of Simulating Local Measurements on Quantum Systems
PCP Theorem [PCP Theorem Is] the Most Important Result in Complexity Theory Since Cook’S Theorem
6. Computational Complexity • Computational Models • Turing
Complexity of Discrete Energy Minimization Problems
Completeness in Approximation Classes Beyond APX Bruno Escoffier, Vangelis Th
Structure in Approximation Classes