scientific article; zbMATH DE number 3932433

MaRDI QIDQ3704922zbMATH OpenFDO

Authors A. B. Livchak

Publication date 1985

zbMATH Keywords

polynomial timerelational data basesecond-order predicate logic

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Data structures (68P05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 69493
• scientific article; zbMATH DE number 18636
• scientific article; zbMATH DE number 1303206
• Publication:3487327
• scientific article; zbMATH DE number 4139739
• Polynomial computability of fields of algebraic numbers
• Computability on quasi-Polish spaces
• On the polynomial computability of some rudimentary predicates.
• scientific article; zbMATH DE number 4092769

Cited in

(7)

• Polynomial queries to relational data bases
• Non-computable impressions of computable external rays of quadratic polynomials
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Differentiability of polynomial time computable functions
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• scientific article; zbMATH DE number 782052 (Why is no real title available?)
• Deciding polynomial-transcendental problems

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