scientific article; zbMATH DE number 835741

MaRDI QIDQ4861419zbMATH OpenFDO

Authors

Publication date 17 January 1996

zbMATH Keywords

Computational complexityKyoto (Japan)P-complete languageparallel algorithmspartitioning automataProceedingsSymposiumtree automata

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) Distributed algorithms (68W15)

Cited in

(2)

• scientific article; zbMATH DE number 1377408 (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 Q4861419)