In computational complexity theory, a polynomial-time reduction is a method of solving one problem by means of a hypothetical subroutine for solvingâ€¦Â (More)

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

2007

2007

- Feng Ding, Tongwen Chen, Zenta Iwai
- SIAM J. Control and Optimization
- 2007

This paper is motivated by the practical control considerations that nonlinearity is abundant in industrial processes and outputâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Jean-Charles FaugÃ¨re, Ludovic Perret
- EUROCRYPT
- 2006

The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem ofâ€¦Â (More)

Is this relevant?

2004

2004

- Alexander May
- CRYPTO
- 2004

We address one of the most fundamental problems concerning the RSA cryptoscheme: Does the knowledge of the RSA public key/ secretâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Harry Buhrman, Ronald de Wolf
- IEEE Conference on Computational Complexity
- 2001

The quantum version of communication complexity allows Alice and Bob to communicate qubits and/or to make use of priorâ€¦Â (More)

Is this relevant?

1997

1997

We apply to Petri net theory the technique of polynomial-time many-one reductions. We study boundedness, reachability, deadlockâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Sampath Kannan, Tandy J. Warnow
- SIAM J. Comput.
- 1994

We are iiit,erested here in t w o related problems. The first is determining whether we can triangulate a vertex-colored graphâ€¦Â (More)

Is this relevant?

1994

1994

- Shishir Shah, Jake K. Aggarwal
- ICRA
- 1994

This paper presents a new algorithm for the geometric camera calibration of a fish-eye lens (a high distortion lens) mounted on aâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Mirko KrivÃ¡nek, Jaroslav MorÃ¡vek
- Acta Informatica
- 1986

We consider a class of optimization problems of hierarchical-tree clustering and prove that these problems are NP-hard. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1980

1977

1977

- David A. Plaisted
- J. Comput. Syst. Sci.
- 1977

We show that certain problems involving sparse polynomials wi th integer coefficients are at least as hard as any problem in NPâ€¦Â (More)

Is this relevant?