On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem
Earlier, I.V. Latkin and the author have shown the set partition problem can be reduced to the problem of finding singular points of a cubic hypersurface. The article focuses on the new link between two different research areas as well as on methods to look for singular points or to confirm the smoothness of the hypersurface. Our approach is based on the description of tangent lines to the hypersurface. The existence of at least one singular point imposes a restriction on the algebraic equation that determines the set of tangent lines passing through the selected point of the space. This equation is based on the formula for the discriminant of a univariate polynomial. We have proposed a probabilistic algorithm for some set of inputs of the set partition problem. The probabilistic algorithm is not proved to have polynomial complexity.
KeywordsSet partition Cubic hypersurfaces Smoothness Tangent line Polynomial Discriminant Computational complexity
The author would like to thank Mark Spivakovsky, Sergei P. Tarasov, Mikhail N. Vyalyi, and the anonymous reviewers for useful comments.
- 10.Latkin, I.V., Seliverstov, A.V.: Computational complexity of fragments of the theory of complex numbers. Bulletin of University of Karaganda. Ser. Mathematics, vol. 1, pp. 47–55 (2015). (in Russian)Google Scholar
- 11.Seliverstov, A.V.: On cubic hypersurfaces with involutions. In: Vassiliev, N.N. (ed.) International Conference Polynomial Computer Algebra 2016, St. Petersburg, 18–22 April 2016, pp. 74–77. VVM Publishing, Saint Petersburg (2016)Google Scholar
- 12.Nesterov, Y.: Random walk in a simplex and quadratic optimization over convex polytopes. CORE Discussion Paper 2003/71 (2003)Google Scholar