# Co-NP

## Papers overview

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

2016

2016

- Fuzzy Sets and Systems
- 2016

We provide a methodology to introduce relational hypersequent calculi for a large class of many-valued logics, and a sufficientâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- SIAM J. Comput.
- 2007

We show that finding small solutions to random modular linear equations is at least as hard as approximating several latticeâ€¦Â (More)

Is this relevant?

2005

2005

- J. Log. Comput.
- 2005

Extending results of Schindler, Hamkins and Welch, we establish in the context of infinite time Turing machines that P isâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- PODS
- 2005

Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specificationâ€¦Â (More)

Is this relevant?

2003

2003

- Inf. Process. Lett.
- 2003

In 1996, Fredman and Khachiyan [J. Algorithms 21 (1996) 618â€“628] presented a remarkable algorithm for the problem of checking theâ€¦Â (More)

Is this relevant?

2000

2000

- Math. Program.
- 2000

The classes of P-, P 0-, R 0-, semimonotone, strictly semimonotone, column suucient, and nondegenerate matrices play importantâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- STOC
- 1997

We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also showâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Inf. Comput.
- 1995

It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existentialâ€¦Â (More)

Is this relevant?

1991

1991

- J. Algorithms
- 1991

Algorithmic problems in braid groups have received much attention since [Ã€1]. An algorithm for the word problem was givenâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- J. ACM
- 1991

In this paper we demonstrate the generality and wide applicability of zero-knowledge proofs, a notion introduced by Goldwasserâ€¦Â (More)

Is this relevant?