History
1
106
Year:
-
Type:
Journal
Book
Article
Please fill in your query. A complete syntax description you will find on the General Help page.

Result 81 to 100 from 106 total

Nonembeddability theorems via Fourier analysis. (English)
FOCS, 101-112(2005)
WorldCat.org
81
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. (English)
WINE, 92-101(2005)
WorldCat.org
82
Guest column: inapproximability results via Long Code based PCPs. (English)
SIGACT News 36, N0. 2, 25-42(2005)
WorldCat.org
83
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. (English)
Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 11-20, electronic only (2004).
WorldCat.org
84
Cell-probe lower bounds for the partial match problem. (English)
J. Comput. Syst. Sci. 69, No. 3, 435-447 (2004).
WorldCat.org
85
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. (English)
FOCS, 136-145(2004)
WorldCat.org
86
Hardness of Approximating the Shortest Vector Problem in Lattices. (English)
FOCS, 126-135(2004)
WorldCat.org
87
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? (English)
FOCS, 146-154(2004)
WorldCat.org
88
Cell-probe lower bounds for the partial match problem. (English)
Proceedings of the thirty-fifth annual ACM symposium on theory of computing (STOC 2003), San Diego, CA, USA,. New York, NY: ACM Press (ISBN 1-58113-674-9). 667-672, electronic only (2003).
WorldCat.org
89
A new multilayered {PCP} and the hardness of hypergraph vertex cover. (English)
Proceedings of the thirty-fifth annual ACM symposium on theory of computing (STOC 2003), San Diego, CA, USA,. New York, NY: ACM Press (ISBN 1-58113-674-9). 595-601, electronic only (2003).
WorldCat.org
90
A new multilayered PCP and the hardness of hypergraph vertex cover. (English)
Comput. Res. Repos. 2003, Article No. 0304026 (2003).
WorldCat.org
91
Fitting algebraic curves to noisy data. (English)
J. Comput. Syst. Sci. 67, No. 2, 325-340 (2003).
WorldCat.org
92
Hardness of Approximating the Shortest Vector Problem in High Lp Norms. (English)
FOCS, 290-297(2003)
WorldCat.org
93
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. (English)
IEEE Conference on Computational Complexity, 107-117(2003)
WorldCat.org
94
A Strong Inapproximability Gap for a Generalization of Minimum Bisection. (English)
IEEE Conference on Computational Complexity, 371-378(2003)
WorldCat.org
95
On the power of unique 2-prover 1-round games. (English)
Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19‒21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 767-775, electronic only (2002).
WorldCat.org
96
Hardness results for approximate hypergraph coloring. (English)
Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19‒21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 351-359, electronic only (2002).
WorldCat.org
97
Fitting algebraic curves to noisy data. (English)
Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19‒21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 162-169, electronic only (2002).
WorldCat.org
98
Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k-3-epsilon). (English)
Electron. Colloq. Comput. Complex. 2002, Article No. 027 (2002).
WorldCat.org
99
Parameterized complexity of finding subgraphs with hereditary properties. (English)
Theor. Comput. Sci. 289, No. 2, 997-1008 (2002).
WorldCat.org
100

Result 81 to 100 from 106 total

Valid XHTML 1.0 Transitional Valid CSS!