Expressiveness and complexity of generic graph machines

DOI10.1007/S002240000087zbMath0896.68054OpenAlexW2102659415MaRDI QIDQ1387823

M. Gemis, Jan Paredaens, Jan Van den Bussche, Peter Peelman

Publication date: 8 June 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/693

zbMATH Keywords

generic graph machineTM complexity

Mathematics Subject Classification ID

This page was built for publication: Expressiveness and complexity of generic graph machines