Semantic Scholar uses AI to extract papers important to this topic.
- SIAM J. Control and Optimization
This paper is motivated by the practical control considerations that nonlinearity is abundant in industrial processes and output… (More)
The Isomorphism of Polynomials (IP) , which is the main concern of this paper, originally corresponds to the problem of… (More)
We address one of the most fundamental problems concerning the RSA cryptoscheme: Does the knowledge of the RSA public key/ secret… (More)
- IEEE Conference on Computational Complexity
The quantum version of communication complexity allows Alice and Bob to communicate qubits and/or to make use of prior… (More)
We apply to Petri net theory the technique of polynomial-time many-one reductions. We study boundedness, reachability, deadlock… (More)
We are iiit,erested here in t w o related problems. The first is determining whether we can triangulate a vertex-colored graph… (More)
This paper presents a new algorithm for the geometric camera calibration of a fish-eye lens (a high distortion lens) mounted on a… (More)
We consider a class of optimization problems of hierarchical-tree clustering and prove that these problems are NP-hard. The… (More)
- J. Comput. Syst. Sci.
We show that certain problems involving sparse polynomials wi th integer coefficients are at least as hard as any problem in NP… (More)