In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logicalâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2005

2005

- Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko
- Math. Oper. Res.
- 2005

In this paper we study polynomial time approximation schemes (PTASes) for the no-wait job shop scheduling problem with theâ€¦Â (More)

Is this relevant?

2005

2005

Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints

Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certainâ€¦Â (More)

Is this relevant?

2002

2002

- Sudipto Guha, Kamesh Munagala
- SODA
- 2002

We study the data placement problem [1, 3], where the goal is to place certain data objects (with possible replication) in fixedâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Ivan D. Baev, Rajmohan Rajaraman
- SODA
- 2001

We study approximation algorithms for placing replicated data in arbitrary networks. Consider a network of nodes with individualâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We study a novel genre of optimization problems, which we call segmentation problems, motivated in part by certain aspects ofâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Let Dist(f; g) = Pru [ f(u)6=g(u) ] denote the relative distance between functions f; g mapping from a group G to a group H , andâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Mihir Bellare, Shafi Goldwasser, Carsten Lund, A. Russeli
- STOC
- 1993

Efficient Probabilistically Checkable Proofs and Applications to Approximation M. BELLARE* S. GOLDWASSERt C. LUNDi A. RUSSELL$ Weâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Christos H. Papadimitriou, Mihalis Yannakakis
- Structure in Complexity Theory Conference
- 1993

We characterize precisely the complexity of several natural computational problems in NP, which have been proposed but notâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
- FOCS
- 1992

The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine thatâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Christos H. Papadimitriou, Mihalis Yannakakis
- J. Comput. Syst. Sci.
- 1991

W e define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, andâ€¦Â (More)

Is this relevant?