scientific article; zbMATH DE number 3329939

MaRDI QIDQ5608026zbMATH OpenFDO

Authors Yuri Petrovich Ofman

Publication date 1965

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(3)

• Complexity theory of parallel time and hardware
• Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
• Shorter arithmetization of nondeterministic computations

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