Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)

Miki Hermann, Phokion G. Kolaitis. Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). In Jirí Wiedermann, Petr Hájek, editors, Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS 95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings. Volume 969 of Lecture Notes in Computer Science, pages 359-370, Springer, 1995.

Abstract

Abstract is missing.