Scalability and the isomorphism problem
type: Item
instance of: scholarly article
title: Scalability and the isomorphism problem
zbMATH Open document ID: 0875.68542
DOI: 10.1016/0020-0190(95)00204-9
author: J. Goldsmith
author: S. Homer
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984445
zbMATH Keywords: Computational complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00204-9
OpenAlex ID: W2011388976
cites work: P-Printable Sets
cites work: Q3747725
cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets
cites work: Polynomial-time compression
cites work: On sets polynomially enumerable by iteration
cites work: On the complexity of ranking
cites work: Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
cites work: Reductions among polynomial isomorphism types
cites work: Polynomial Time Enumeration Reducibility
cites work: Toward a Theory of Enumerations
description: scientific article; zbMATH DE number 984445