"On Polynomial Time Turing and Many-One Completeness in PSPACE."

Osamu Watanabe, Shouwen Tang (1989)

Details and statistics

DOI: 10.1109/SCT.1989.41810

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

a service of  Schloss Dagstuhl - Leibniz Center for Informatics