On Syntactic versus Computational Views of Approximability
type: Item
instance of: scholarly article
title: On Syntactic versus Computational Views of Approximability
zbMATH Open document ID: 0915.68068
DOI: 10.1137/S0097539795286612
author: Sanjeev Khanna
author: Umesh V. Vazirani
author: Madhu Sudan
author: Rajeev Motwani
published in: SIAM Journal on Computing
publication date: 1998-09-21T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1200782
zbMATH Keywords: approximation algorithms
zbMATH Keywords: complete problems
zbMATH Keywords: computational complexity
zbMATH Keywords: computational classes
zbMATH Keywords: polynomial reductions
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: s0097539795286612
OpenAlex ID: W2159579504
Recommended article: A syntactic view of computational adequacy
Recommended article: Q3974858
Recommended article: Q4697391
Recommended article: Computational complexity of the semantics of some natural language constructions
Recommended article: The computational complexity of ideal semantics
Recommended article: Q3769985
Recommended article: Finite Approximations and Similarity of Languages
Recommended article: Computational complexity of syntactic agreement and lexical ambiguity
Recommended article: On computational complexity of contextual languages
Recommended article: Q4292787
description: scientific article; zbMATH DE number 1200782