A hypothetical way to compute an upper bound for the heights of solutions of a Diophantine equation with a finite number of solutions
Saved in:
| Main Author: | Apoloniusz Tyszka |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2015-10-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_5/pliks/41.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Existence of Solutions of Diophantine Equations Related to Subbalancing Numbers
by: Selin Sarı, et al.
Published: (2025-01-01) -
MuPAD codes which implement limit-computable functions that cannot be bounded by any computable function
by: Apoloniusz Tyszka
Published: (2014-09-01) -
DETECTION OF DEADLOCKS IN PARALLEL PROGRAMS AS SOLUTION OF LINEAR DIOPHANTINE EQUATIONS
by: Olga F. Babakhyan
Published: (2011-08-01) -
An Adaptive Vibration Control Procedure Based on Symbolic Solution of Diophantine Equation
by: Lucyna LENIOWSKA
Published: (2013-10-01) -
Solutions of the Diophantine Equations Br=Js+Jt and Cr=Js+Jt
by: Ahmed Gaber, et al.
Published: (2023-01-01)