Finding numerical solutions of Diophantine equations using ant colony optimization

DOI10.1016/j.amc.2013.05.051zbMath1304.11138arXiv1306.0896OpenAlexW2156545963MaRDI QIDQ2513573

Mukund Sanglikar, Siby Abraham, Sugata Sanyal

Publication date: 28 January 2015

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0896

zbMATH Keywords

ant colony optimizationDiophantine equationpheromone

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computer solution of Diophantine equations (11Y50)

Related Items (3)

Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm ⋮ Ising Machines for Diophantine Problems in Physics ⋮ Diophantine approximation over primes with different powers

Cites Work

• Ant colony optimization theory: a survey
• Cryptanalysis of a Diophantine equation oriented public key cryptosystem
• Two-Way Counter Machines and Diophantine Equations
• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms
• Elliptic Curves from Mordell to Diophantus and Back
• A new public-key cipher system based upon the diophantine equations
• Mathematical problems
• Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding numerical solutions of Diophantine equations using ant colony optimization