A note on a theorem by Ladner
type: Item
instance of: scholarly article
title: A note on a theorem by Ladner
zbMATH Open document ID: 0515.03022
DOI: 10.1016/0020-0190(82)90113-2
author: J. Díaz
author: José L. Balcázar
published in: Information Processing Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D55
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3813601
zbMATH Keywords: P
zbMATH Keywords: NP
zbMATH Keywords: NP-complete
zbMATH Keywords: reducibility
zbMATH Keywords: equivalence
zbMATH Keywords: incomparable
MaRDI profile type: Publication
full work available at URL: 0020-0190(82)90113-2
OpenAlex ID: W1984577660
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: On the Structure of Polynomial Time Reducibility
cites work: A comparison of polynomial time reducibilities
cites work: Q5573961
description: scientific article; zbMATH DE number 3813601