scientific article; zbMATH DE number 5310455

MaRDI QIDQ3517634zbMATH OpenFDO

Authors Luc Longpré, G. William Walster, Vladik Kreinovich, William Gasarch

Publication date 12 August 2008

Mathematics Subject Classification ID

Algorithms with automatic result verification (65G20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the \(M_3\) versus \(M_1\) problem
• Many solutions to the \(S\)-unit equation \(a+1=c\)
• scientific article; zbMATH DE number 1159524
• On m-admissible components of solution
• On the number of solutions of \(p+h=P_ r\)
• On the number of solutions of \([p-1,q-1]\leq x\)
• The number of solutions to Mordell's equation in constrained ranges
• Upper and lower solutions and multiplicity results
• scientific article; zbMATH DE number 3415938
• Upper bounds on the solutions to n=p+m^2

Cited in

(1)

• scientific article; zbMATH DE number 176749 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517634)