scientific article; zbMATH DE number 1346513

MaRDI QIDQ4266537zbMATH OpenFDO

Authors Oscar H. Ibarra, Nicholas Q. Tran

Publication date 3 October 1999

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15)

Cited in

(4)

• A communication hierarchy of parallel computations
• Communication for alternating machines
• Synchronized tree automata
• Deterministic versus nondeterministic space in terms of synchronized alternating machines

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