Computational complexity of simultaneous elementary matching problems
From MaRDI portal
Publication:5900977
DOI10.1007/3-540-60246-1_142zbMath1193.03027OpenAlexW1499877119MaRDI QIDQ5900977
Miki Hermann, Phokion G. Kolaitis
Publication date: 17 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60246-1_142
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Unification algorithms cannot be combined in polynomial time ⋮ Unification algorithms cannot be combined in polynomial time.
This page was built for publication: Computational complexity of simultaneous elementary matching problems
