Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient probabilistic checkable proofs and applications to approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Complexity of Minimizing FBDDs
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
The Query Complexity of Program Checking by Constant-Depth Circuits
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Approximation of a Geometric Set Covering Problem
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Multi-linearity Self-Testing with Relative Error
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Low Communication 2-Prover Zero-Knowledge Proofs for NP
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On Message Proof Systems with Known Space Verifiers
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Using Approximation Hardness to Achieve Dependable Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A generalization of Fagin's theorem
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Tight Bound on Johnson's Algoritihm for Max-SAT
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Holographic algorithms: guest column
ACM SIGACT News
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
Using genetic programming to approximate maximum clique
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
SIGACT news complexity theory column 64
ACM SIGACT News
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Probabilistically Checkable Proofs Over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters
An effective local search for the maximum clique problem
Information Processing Letters
APX-hardness of domination problems in circle graphs
Information Processing Letters
The ideal membership problem and polynomial identity testing
Information and Computation
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The greedier the better: an efficient algorithm for approximating maximum independent set
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A memetic-clustering-based evolution strategy for traveling salesman problems
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Shortest common superstring problem with discrete neural networks
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Discrete Applied Mathematics
Algorithms and theory of computation handbook
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Almost transparent short proofs for NPR
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Approximation algorithms for minimum span channel assignment problems
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
From primal-dual to cost shares and back: a stronger LP relaxation for the steiner forest problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Approximating integer quadratic programs and MAXCUT in subdense graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Multicast routing with minimum energy cost and minimum delay in wireless sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Average-case non-approximability of optimisation problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On some relations between approximation problems and PCPs over the real numbers
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
An algorithm for finding a maximum clique in a graph
Operations Research Letters
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
Max-k-Cut by the Discrete Dynamic Convexized Method
INFORMS Journal on Computing
Links organization for channel assignment in multi-radio wireless mesh networks
Multimedia Tools and Applications
| Hi-index | 0.00 |
The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x in L then there exists an oracle y such that the machine accepts for all random choices but if x not in L then for every oracle y the machine rejects with high probability. Arora and Safra (1992) characterized NP as PCP(log n, (loglogn)/sup O(1)/). The authors improve on their result by showing that NP=PCP(logn, 1). The result has the following consequences: (1) MAXSNP-hard problems (e.g. metric TSP, MAX-SAT, MAX-CUT) do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon 0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup epsilon / unless P=NP.