The hardness of the grid problemGi Under the Routine Resolution Method
type: Item
instance of: scholarly article
title: The hardness of the grid problemGi Under the Routine Resolution Method
zbMATH Open document ID: 0592.68038
author: Wenqi Huang
author: Chusheng Lai
author: Zhi-Xiang Chen
published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 3952004
zbMATH Keywords: NP problem
zbMATH Keywords: conjunctive normal form
zbMATH Keywords: clauses
MaRDI profile type: MaRDI publication profile
full work available at URL: malq.19870330110
OpenAlex ID: W1971563430
DOI: 10.1002/MALQ.19870330110
Recommended article: Q5158500
Recommended article: Almost polynomial hardness of node-disjoint paths in grids
Recommended article: On the irregularity strength of them ×n grid
Recommended article: The hardness of embedding grids and walls
Recommended article: The complexity of optimization on grids
Recommended article: On the parameterized complexity of grid contraction
Recommended article: On the Parameterized Complexity Of Grid Contraction
Recommended article: A catalog of Hanan grid problems
Recommended article: NP-completeness for minimizing maximum edge length in grid embeddings
Recommended article: Q4778553
description: scientific article