Are there any known nonslow methods for solving diophantine systems?
I can't find books of mathematics that appear methods explaining how to solve diophantine systems in a manner "not slow", e.g. not force brute enumeration.
Are there any known nonslow methods for solving diophantine systems? I can't find books of mathematics that appear methods explaining how to solve diophantine systems in a manner "not slow", e.g. not force brute enumeration. 

closed as too localized by Andres Caicedo, Mark Sapir, Will Jagy, Felipe Voloch, José FigueroaO'Farrill Dec 14 '10 at 2:59This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center. If this question can be reworded to fit the rules in the help center, please edit the question. 


You must not have looked very hard. This will get you started: Nigel P. Smart. The Algorithmic Resolution of Diophantine Equations. London Mathematical Society Student Texts 41. Cambridge University Press, 1998. However, as Igor and zroslav have mentioned, some problems are unsolvable, others believed to be very hard, so don't be surprised that there are no "easy" methods. 

