\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness
type: Item
instance of: scholarly article
title: \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness
zbMATH Open document ID: 0896.68060
published in: Theory of Computing Systems
publication date: 1998-10-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1160534
zbMATH Keywords: Turing-complete sets
author: Edith Hemaspaandra
author: Lane A. Hemaspaandra
author: Harald Hempel
MaRDI profile type: Publication
full work available at URL: s002240000090
OpenAlex ID: W2057527249
DOI: 10.1007/S002240000090
description: scientific article; zbMATH DE number 1160534