On hard instances
type: Item
instance of: scholarly article
title: On hard instances
zbMATH Open document ID: 0947.68079
DOI: 10.1016/S0304-3975(98)00262-X
author: Martin Mundhenk
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1493363
zbMATH Keywords: instance complexity
zbMATH Keywords: hard instances
MaRDI profile type: Publication
cites work: Q4256649
cites work: Q3692867
cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets
cites work: SPARSE Reduces Conjunctively to TALLY
cites work: Random strings make hard instances
cites work: On resource-bounded instance complexity
cites work: New Collapse Consequences of NP Having Small Circuits
cites work: Q4023358
cites work: On Reducibility to Complex or Sparse Sets
cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
cites work: Q4699319
cites work: Instance complexity
cites work: Q3219763
full work available at URL: s0304-3975(98)00262-x
OpenAlex ID: W2089937401
Recommended article: Q4501544
Recommended article: Q4201937
Recommended article: Many hard examples for resolution
Recommended article: Q4252738
Recommended article: Hard examples for resolution
Recommended article: Q4251043
Recommended article: Q4012216
Recommended article: On the threshold of intractability
description: scientific article; zbMATH DE number 1493363