Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
The hardness of approximation: gap location
Computational Complexity
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
How good is the Goemans-Williamson MAX CUT algorithm?
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 '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Tight Bound on Johnson's Algoritihm for Max-SAT
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Derandomizing semidefinite programming based approximation algorithms
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th 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)
Recycling queries in PCPs and in linearity tests (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Constructing worst case instances for semidefinite programming based approximation algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability Results for Equations over Finite Groups
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
The Non-approximability of Non-Boolean Predicates
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Discrete Applied Mathematics
Inapproximability results for equations over finite groups
Theoretical Computer Science - Special issue on automata, languages and programming
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
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
3-bit dictator testing: 1 vs. 5/8
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
ACM Transactions on Computation Theory (TOCT)
Conditional Hardness of Approximating Satisfiable Max 3CSP-q
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
An approximation algorithm for max p-section
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Inapproximability results for equations over infinite groups
Theoretical Computer Science
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
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
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
NP-hardness of approximately solving linear equations over reals
Proceedings of the forty-third annual ACM symposium on Theory of computing
Randomly Supported Independence and Resistance
SIAM Journal on Computing
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Bypassing UGC from some optimal geometric inapproximability results
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating Max kCSP - outperforming a random assignment with almost a linear factor
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
Approximating Linear Threshold Predicates
ACM Transactions on Computation Theory (TOCT)
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
Improved algorithms for weighted and unweighted set splitting problems
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A characterization of approximation resistance for even k-partite CSPs
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
On the usefulness of predicates
ACM Transactions on Computation Theory (TOCT)
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
Explicit Optimal Hardness via Gaussian Stability Results
ACM Transactions on Computation Theory (TOCT)
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
| Hi-index | 0.00 |