Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Generic complexity of the Diophantine problem

Generic complexity of the Diophantine problem Abstract. The generic-case approach to algorithmic problems was suggested by Myasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies the behavior of an algorithm on “most” or “typical” inputs. The remaining inputs form the so-called black hole of the algorithm. In the present paper we consider Hilbert's tenth problem and use arithmetic circuits for the representation of Diophantine equations. We prove that this Diophantine problem is generically hard in the following sense. For every generic polynomial algorithm deciding this problem, there exists a polynomial algorithm for random generation of inputs from the black hole. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Generic complexity of the Diophantine problem

Rybalov, Alexander
Groups Complexity Cryptology , Volume 5 (1) – May 1, 2013
Download PDF
6 pages

Loading next page...
 
/lp/de-gruyter/generic-complexity-of-the-diophantine-problem-D2WJJQj2dL
Publisher
de Gruyter
Copyright
Copyright © 2013 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2013-0004
Publisher site
See Article on Publisher Site

Abstract

Abstract. The generic-case approach to algorithmic problems was suggested by Myasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies the behavior of an algorithm on “most” or “typical” inputs. The remaining inputs form the so-called black hole of the algorithm. In the present paper we consider Hilbert's tenth problem and use arithmetic circuits for the representation of Diophantine equations. We prove that this Diophantine problem is generically hard in the following sense. For every generic polynomial algorithm deciding this problem, there exists a polynomial algorithm for random generation of inputs from the black hole.

Journal

Groups Complexity Cryptology – de Gruyter

Published: May 1, 2013

There are no references for this article.