Average case complete problems
SIAM Journal on Computing
Many hard examples for resolution
Journal of the ACM (JACM)
Computational Complexity
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The 2-catalog segmentation problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation algorithms for maximization problems arising in graph partitioning
Journal of Algorithms
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A polylogarithmic approximation of the minimum bisection
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the Hardness of Finding Optimal Multiple Preset Dictionaries
DCC '01 Proceedings of the Data Compression Conference
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Combinatorics, Probability and Computing
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A New Conceptual Clustering Framework
Machine Learning
Finding the most interesting correlations in a database: how hard can it be?
Information Systems
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lower bounds for k-DNF resolution on random 3-CNFs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Theoretical Computer Science
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Directed metrics and directed graph partitioning problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing
On the maximum satisfiability of random formulas
Journal of the ACM (JACM)
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Extraction and classification of dense communities in the web
Proceedings of the 16th international conference on World Wide Web
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
Foundations and Trends® in Theoretical Computer Science
A plant location guide for the unsure
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
Approximating Generalized Multicut on Trees
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Partitioning graphs into balanced components
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Extraction and classification of dense implicit communities in the Web graph
ACM Transactions on the Web (TWEB)
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
Small Clique Detection and Approximate Nash Equilibria
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Inapproximability of maximum weighted edge biclique and its applications
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Proceedings of the forty-second ACM symposium on Theory of computing
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Finding maximum edge bicliques in convex bipartite graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
The hospitals/residents problem with quota lower bounds
ESA'11 Proceedings of the 19th European conference on Algorithms
Cryptography in constant parallel time
Cryptography in constant parallel time
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Some results on average-case hardness within the polynomial hierarchy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms and hardness of the k-route cut problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the hardness and easiness of random 4-SAT formulas
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
On pseudorandom generators with linear stretch in NC0
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Optimizing budget allocation among channels and influencers
Proceedings of the 21st international conference on World Wide Web
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Pseudorandom generators with long stretch and low locality from random local one-way functions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
On quadratic programming with a ratio objective
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Journal of the ACM (JACM)
Approximation algorithms for the sex-equal stable marriage problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We investigate relations between average case complexity and the complexity of approximation. Our preliminary findings indicate that this is a research direction that leads to interesting insights. Under the assumption that refuting 3SAT is hard on average on a natural distribution, we derive hardness of approximation results for min bisection, dense k-subgraph, max bipartite clique and the 2-catalog segmentation problem. No NP-hardness of approximation results are currently known for these problems.