Improving a fixed parameter tractability time bound for the shadow problem
type: Item
instance of: scholarly article
title: Improving a fixed parameter tractability time bound for the shadow problem
zbMATH Open document ID: 1092.68048
DOI: 10.1016/S0022-0000(03)00079-5
author: Peter Heusch
author: Stefan Porschen
author: Ewald Speckenmeyer
published in: Journal of Computer and System Sciences
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2092873
zbMATH Keywords: Shadow independent set
zbMATH Keywords: Shadow pattern
zbMATH Keywords: Pure implicational formula
zbMATH Keywords: Dynamic programming
zbMATH Keywords: Fixed parameter tractability
MaRDI profile type: Publication
cites work: The complexity of theorem-proving procedures
cites work: Q4027320
cites work: An algorithm for the class of pure implicational formulas
cites work: Q4198056
cites work: Q4375757
cites work: Q4860310
cites work: The complexity of the falsifiability problem for pure implicational formulas
cites work: Q4315881
cites work: Q5783647
description: scientific article; zbMATH DE number 2092873