scientific article

zbMATH Open0679.03016MaRDI QIDQ3835450

Yu. V. Matiyasevich

Publication date: 1988

Title of this publication is not available (Why is that?)

zbMATH Keywords

surveyrecursively enumerable setcomplexity measuresDavis normal formdiophantine complexityexponential Diophantine representation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Diophantine equations (11D99)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The complexity of almost linear diophantine problems 👍 👎
• Diophantine hierarchy 👍 👎
• Diophantine complexity 👍 👎
• Generic complexity of the Diophantine problem 👍 👎
• Computational complexities of diophantine equations with parameters 👍 👎
• Diophantine integrability 👍 👎

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 Q3835450)