Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
On the power of multi-prover interactive protocols
Theoretical Computer Science
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity and approximability of finding maximum feasible subsystems of linear relations
Theoretical Computer Science
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Approximability of maximum splitting of k-sets and some other Apx-complete problems
Information Processing Letters
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
A new way to use semidefinite programming with applications to linear equations mod p
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Gadgets, Approximation, and Linear Programming
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Tight Characterization of NP with 3 Query PCPs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
On the advantage over a random assignment
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The complexity of solving equations over finite groups
Information and Computation
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Inapproximability Results for Equations over Finite Groups
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Non-approximability of weighted multiple sequence alignment
Theoretical Computer Science - Computing and combinatorics
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
Approximation algorithms for aligning points
Proceedings of the nineteenth annual symposium on Computational geometry
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Information Processing Letters
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Combinatorics, Probability and Computing
The Difficulty of Reduced Error Pruning of Leveled Branching Programs
Annals of Mathematics and Artificial Intelligence
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability results for equations over finite groups
Theoretical Computer Science - Special issue on automata, languages and programming
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximating the cut-norm via Grothendieck's inequality
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
The inapproximability of lattice and coding problems with preprocessing
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On the advantage over a random assignment
Random Structures & Algorithms
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Journal of Algorithms
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Every 2-CSP allows nontrivial approximation
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
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the b-chromatic number
Discrete Applied Mathematics
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Clustering with qualitative information
Journal of Computer and System Sciences - Special issue: Learning theory 2003
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
Computational Optimization and Applications
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
Journal of Computer and System Sciences
On the complexity of approximating k-set packing
Computational Complexity
On the approximability of maximum and minimum edge clique partition problems
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Information Processing Letters
Generalization of land cover maps by mixed integer programming
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Finding a maximum likelihood tree is hard
Journal of the ACM (JACM)
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
On the maximum satisfiability of random formulas
Journal of the ACM (JACM)
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
Discrete Applied Mathematics
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
Hardness of routing with congestion in directed graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating almost all instances of MAX-CUT within a ratio above the håstad threshold
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Note: Note on maximal split-stable subgraphs
Discrete Applied Mathematics
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Foundations and Trends® in Theoretical Computer Science
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
Approximating maximum satisfiable subsystems of linear equations of bounded width
Information Processing Letters
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An optimal sdp algorithm for max-cut, and equally optimal long code tests
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sums of squares based approximation algorithms for MAX-SAT
Discrete Applied Mathematics
Holographic algorithms: guest column
ACM SIGACT News
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
PCPs with small soundness error
ACM SIGACT News
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
How to Encrypt with the LPN Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Distributed weighted vertex cover via maximal matchings
ACM Transactions on Algorithms (TALG)
Combinatorial network abstraction by trees and distances
Theoretical Computer Science
Polynomials that Sign Represent Parity and Descartes' Rule of Signs
Computational Complexity
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
Improved Approximation Algorithms for the Spanning Star Forest Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Approximation Resistance of a Random Predicate
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
ACM SIGACT News
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
3-bit dictator testing: 1 vs. 5/8
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
Introduction to the Maximum Solution Problem
Complexity of Constraints
Note: Minimal achievable approximation ratio for MAX-MQ in finite fields
Theoretical Computer Science
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Randomly supported independence and resistance
Proceedings of the forty-first annual ACM symposium on Theory of computing
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms (TALG)
On compressing social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximating the Spanning k-Tree Forest Problem
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hardness and approximation of traffic grooming
Theoretical Computer Science
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers
ACM Transactions on Computation Theory (TOCT)
ACM Transactions on Computation Theory (TOCT)
On Hardness of Pricing Items for Single-Minded Bidders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Hypergraph Dictatorship Test with Perfect Completeness
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 random satisfiable process
Combinatorics, Probability and Computing
Approximation for minimum total dominating set
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Conditional Hardness of Approximating Satisfiable Max 3CSP-q
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximate Pure Nash Equilibria via Lovász Local Lemma
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Notes: On approximating the b-chromatic number
Discrete Applied Mathematics
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Finding an unknown acyclic orientation of a given graph
Combinatorics, Probability and Computing
Short PCPPs verifiable in polylogarithmic time with O(1) queries
Annals of Mathematics and Artificial Intelligence
Average-case analysis for the MAX-2SAT problem
Theoretical Computer Science
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Learning Acyclic Probabilistic Circuits Using Test Paths
The Journal of Machine Learning Research
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Approximability and parameterized complexity of consecutive ones submatrix problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A spectral method for MAX2SAT in the planted solution model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Efficient cryptographic protocols based on the hardness of learning parity with noise
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Inapproximability results for equations over infinite groups
Theoretical Computer Science
Energy efficient monitoring in sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing
Propagation connectivity of random hypergraphs
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Operations Research
Solving MAX-r-SAT above a tight lower bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Some results on incremental vertex cover problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
On the approximability of the vertex cover and related problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Inapproximability of hypergraph vertex cover and applications to scheduling problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Improved orientations of physical networks
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating linear threshold predicates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximate Lasserre integrality gap for unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A query efficient non-adaptive long code test with perfect completeness
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A tighter upper bound for random MAX 2-SAT
Information Processing Letters
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
On the complexity of reconfiguration problems
Theoretical Computer Science
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
SIAM Journal on Computing
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Short locally testable codes and proofs: a survey in two parts
Property testing
Query-efficient dictatorship testing with perfect completeness
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Query-efficient dictatorship testing with perfect completeness
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
PCPs and the hardness of generating private synthetic data
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Towards non-black-box lower bounds in cryptography
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing
NP-hardness of approximately solving linear equations over reals
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
A lower bound on the value of entangled binary games
Quantum Information & Computation
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's
Quantum Information & Computation
Approximation algorithms for orienting mixed graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Short locally testable codes and proofs
Studies in complexity and cryptography
Satisfying degree-d equations over GF[2]n
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Nearly optimal NP-hardness of vertex cover on k-uniform k-partite hypergraphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
ESA'11 Proceedings of the 19th European conference on Algorithms
Strong and weak edges of a graph and linkages with the vertex cover problem
Discrete Applied Mathematics
Matrix $p$-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
SIAM Journal on Matrix Analysis and Applications
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
SIAM Journal on Optimization
Randomly Supported Independence and Resistance
SIAM Journal on Computing
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Learning hurdles for sleeping experts
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Secure set membership using 3SAT
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Kernels for the vertex cover problem on the preferred attachment model
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
The MAX-CUT of sparse random graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating CSPs with global cardinality constraints using SDP hierarchies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the hardness of pricing loss-leaders
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Submodular functions are noise stable
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation of self-stabilizing vertex cover less than 2
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Distributed weighted vertex cover via maximal matchings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Performance tradeoffs in structured peer to peer streaming
Journal of Parallel and Distributed Computing
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Combinatorial network abstraction by trees and distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT
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
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
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Randomized variants of Johnson's algorithm for MAX SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight approximability results for the maximum solution equation problem over Zp
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximating Linear Threshold Predicates
ACM Transactions on Computation Theory (TOCT)
The computational complexity of delay management
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Multi-Dimensional resilient statistical en-route filtering in wireless sensor networks
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Systems of linear equations over F2 and problems parameterized above average
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An explicit upper bound for the approximation ratio of the maximum gene regulatory network problem
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Guest column: algebraic construction of projection PCPs
ACM SIGACT News
On the relative merits of simple local search methods for the MAX-SAT problem
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Complete convergence of message passing algorithms for some satisfiability 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
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Approximating maximum cut with limited unbalance
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Differential approximation of MIN SAT, MAX SAT and related problems
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Improved parameterized algorithms for above average constraint satisfaction
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Approximation with a fixed number of solutions of some biobjective maximization problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Survey: A survey on the structure of approximation classes
Computer Science Review
On the inapproximability of maximum intersection problems
Information Processing Letters
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Communication: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
Discrete Applied Mathematics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On approximating string selection problems with outliers
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Quasi-randomness and algorithmic regularity for graphs with general degree distributions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
An invariance principle for polytopes
Journal of the ACM (JACM)
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
A characterization of approximation resistance for even k-partite CSPs
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of many one-bit provers
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Approximation algorithm for a class of global optimization problems
Journal of Global Optimization
Journal of Combinatorial Optimization
Revisiting lightweight authentication protocols based on hard learning problems
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
On the usefulness of predicates
ACM Transactions on Computation Theory (TOCT)
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
Multipartite entanglement in XOR games
Quantum Information & Computation
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximation resistance on satisfiable instances for predicates with few accepting inputs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
Cones of multipowers and combinatorial optimization problems
Computational Mathematics and Mathematical Physics
Explicit Optimal Hardness via Gaussian Stability Results
ACM Transactions on Computation Theory (TOCT)
Matrix sparsification and nested dissection over arbitrary fields
Journal of the ACM (JACM)
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
On approximating string selection problems with outliers
Theoretical Computer Science
On the approximability of maximum and minimum edge clique partition problems
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Journal of Combinatorial Theory Series B
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
ACM Transactions on Computation Theory (TOCT)
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science
Autonomous Agents and Multi-Agent Systems
Column Subset Selection Problem is UG-hard
Journal of Computer and System Sciences
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Journal of Computer and System Sciences
Annals of Mathematics and Artificial Intelligence
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.03 |
We prove optimal, up to an arbitrary ε 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds for the efficient approximability of many optimization problems studied previously. In particular, for Max-E2-Sat, Max-Cut, Max-di-Cut, and Vertex cover.