scientific article; zbMATH DE number 50516

MaRDI QIDQ4000164zbMATH OpenFDO

Authors

Publication date 18 September 1992

zbMATH Keywords

automataComplexity of computationComputational algorithmsdatabase systemsFundamental theorygrammarsKyoto (Japan)languageslogic circuitsnetworksProceedingsreasoningSymposiumterm rewriting systems

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Complexity of computation (including implicit computational complexity) (03D15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Cited in

(11)

• scientific article; zbMATH DE number 3950421 (Why is no real title available?)
• scientific article; zbMATH DE number 3963157 (Why is no real title available?)
• scientific article; zbMATH DE number 4035751 (Why is no real title available?)
• scientific article; zbMATH DE number 4041233 (Why is no real title available?)
• scientific article; zbMATH DE number 4045088 (Why is no real title available?)
• scientific article; zbMATH DE number 47725 (Why is no real title available?)
• scientific article; zbMATH DE number 50560 (Why is no real title available?)
• scientific article; zbMATH DE number 194741 (Why is no real title available?)
• scientific article; zbMATH DE number 1377408 (Why is no real title available?)
• scientific article; zbMATH DE number 835741 (Why is no real title available?)
• scientific article; zbMATH DE number 1401968 (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 Q4000164)