On the query complexity of clique size and maximum satisfiability
type: Item
instance of: scholarly article
title: On the query complexity of clique size and maximum satisfiability
zbMATH Open document ID: 0859.68037
author: Richard Chang
published in: Journal of Computer and System Sciences
publication date: 1997-03-31T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 950755
zbMATH Keywords: bounded query complexity
zbMATH Keywords: maximum clique
zbMATH Keywords: Clique Size
MaRDI profile type: Publication
full work available at URL: jcss.1996.0070
OpenAlex ID: W2123376621
DOI: 10.1006/JCSS.1996.0070
Recommended article: On the approximability of clique and related maximization problems
Recommended article: On the maximum quasi-clique problem
Recommended article: A SAT Approach to Clique-Width
Recommended article: Q4945528
Recommended article: Cliques, colouring and satisfiability: from structure to algorithms
Recommended article: On hardness of approximating the parameterized clique problem
Recommended article: On the complexity of fixed parameter clique and dominating set
Recommended article: Q5417642
Recommended article: Q5327074
description: scientific article; zbMATH DE number 950755