Lane A. Hemaspaandra Dept. of Computer Science, University of Rochester...  Home/Search
Context
Related
| depaul.edu/documents/phmeth.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: depaul.edu/Research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this survey, we highlight selected complete problems from Part I of this column, and include reductions for some of them. We also discuss methods for proving hardness of approximation in the second and higher levels of the Polynomial-Time Hierarchy, and illustrate with two full proofs of non-approximability utilizing error-correcting codes. (Update)
Active bibliography (related documents): More All
1.3: Completeness in the Polynomial Time Hierarchy - Schaefer (2001) (Correct)
0.9: Hardness of Approximating Sigma_2^p Minimization Problems - Umans (1999) (Correct)
0.5: Checking for k-Anonymity Violation by Views - Yao, Wang, Jajodia (2005) (Correct)
Similar documents based on text: More All
0.5: SIGACT News Complexity Theory Column 6 - Lane Hemaspaandra (Correct)
0.5: SIGACT News Complexity Theory Column 19 - Hemaspaandra (1997) (Correct)
0.4: SIGACT News Complexity Theory Column 14 - Lane Hemaspaandra (Correct)
BibTeX entry: (Update)
@misc{ dept-sigact,
author = "Lane Hemaspaandra Dept",
title = "SIGACT News Complexity Theory Column 38",
url = "citeseer.ist.psu.edu/628559.html" }
Citations (may not include all citations):90 The Complexity of Combinatorial Problems with Succinct Input.. (context) - Wagner - 1986
64 The equivalence problem for regular expressions with squarin.. (context) - Meyer, Stockmeyer - 1972
60 Computing with very weak random sources - Srinivasan, Zuckerman - 1999
50 On limited nondeterminism and the complexity of the V--C dim.. (context) - Papadimitriou, Yannakakis - 1996
33 Succinct representations of graphs (context) - Galperin, Wigderson - 1983
29 List decoding algorithms for certain concatenated codes - Guruswami, Sudan - 2000
24 Probabilistically checkable debate systems and approximation.. - Condon, Feigenbaum et al. - 1993
13 List decoding of error-correcting codes (context) - Guruswami - 2001
13 The Minimum Equivalent DNF Problem and Shortest Implicants - Umans - 2001
13 Minimum propositional proof length is NP-hard to linearly ap.. - Alekhnovich, Buss et al. - 1998
13 The Minimum Equivalent DNF Problem and Shortest Implicants - Umans - 1998
10 Recent developments in explicit constructions of extractors (context) - Shaltiel - 2002
9 the complexity of pattern matching for highly compressed two.. - Berman, Karpinski et al. - 1997
8 Hardness of Approximating # 2 Minimization Problems (context) - Umans - 1999
7 the complexity of approximating the VC dimension (context) - Mossel, Umans - 2001
6 Alternation in interaction - Kiwi, Lund et al. - 1994
6 Loss-less condensers (context) - Ta-Shma, Umans et al. - 2001
3 A note on the complexity of the reachability problem for tou.. (context) - Tantau - 2001
2 Approximability and Completeness in the Polynomial Hierarchy (context) - Umans - 2000
2 the complexity of min-max optimization problems and their ap.. (context) - Ko, Lin - 1995
2 the longest circuit in an alterable digraph (context) - Ko, Lin - 1995
2 the complexity and inapproximability of shortest implicant p.. - Umans - 1999
1 Deciding the Vapnik-Cervonenkis dimension is # P 3 -complete (context) - Schafer - 1999
Documents on the same site (http://ovid.cs.depaul.edu/Research.htm): More
Simple Sets Are Not Btt-Cuppable - Schaefer (1997) (Correct)
Deciding the Vapnik-Cervonenkis dimension is ...-complete - Schäfer (1999) (Correct)
Solvability of Graph Inequalities - Schaefer, Stefankovic (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC