Logical language of description of polynomial computing

DOI10.1134/S1064562419020030zbMATH Open1432.03048OpenAlexW2947298579MaRDI QIDQ2313239FDOQ2313239

Authors: D. I. Sviridenko, S. 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

Recommendations

• On the complexity of formulas in semantic programming
• Towards a calculus of algorithms
• On the polynomial computability of some rudimentary predicates.
• A logic for constant-depth circuits
• Polynomial queries to relational data bases

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Computational Complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of formulas in semantic programming
• Conditional terms in semantic programming
• Title not available (Why is that?)

Cited In (5)

• Semantic programming and polynomially computable representations
• Title not available (Why is that?)
• The expressiveness of looping terms in the semantic programming
• Some questions on polynomially computable representations for generating grammars and Backus-Naur forms
• Definable Subsets of Polynomial-Time Algebraic Structures

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

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