Reducibility among Combinatorial Problems
type: Item
instance of: scholarly article
title: Reducibility among Combinatorial Problems
zbMATH Open document ID: 1467.68065
DOI: 10.1007/978-1-4684-2001-2_9
published in: Complexity of Computer Computations
publication date: 2021-07-06T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q04
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7368884
zbMATH Keywords: polynomial time
zbMATH Keywords: Turing machine
zbMATH Keywords: regular expression
zbMATH Keywords: combinatorial problem
zbMATH Keywords: words over a finite alphabet
zbMATH Keywords: language recognition
Wikidata QID: Q110971675
author: Richard Karp
MaRDI profile type: Publication
full work available at URL: 978-1-4684-2001-2 9
OpenAlex ID: W2401610261
description: scientific article; zbMATH DE number 7368884