Logical language of description of polynomial computing

DOI10.1134/S1064562419020030zbMath1432.03048OpenAlexW2947298579MaRDI QIDQ2313239

D. I. Sviridenko, Sergei S. Goncharov

Publication date: 18 July 2019

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562419020030

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Unnamed Item ⋮ The expressiveness of looping terms in the semantic programming

Cites Work

• On the complexity of formulas in semantic programming
• Conditional terms in semantic programming
• Computational Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logical language of description of polynomial computing