Easy problems are sometimes hard
type: Item
instance of: scholarly article
title: Easy problems are sometimes hard
zbMATH Open document ID: 0824.68107
DOI: 10.1016/0004-3702(94)90109-0
author: Toby Walsh
author: Ian P. Gent
published in: Artificial Intelligence
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 710223
zbMATH Keywords: satisfiability
MaRDI profile type: Publication
full work available at URL: 0004-3702(94)90109-0
OpenAlex ID: W2137154807
cites work: Q4138187
cites work: Q4012216
cites work: A Computing Procedure for Quantification Theory
cites work: Q4835268
cites work: The hardest constraint problems: A double phase transition
cites work: Branch-and-cut solution of inference problems in propositional logic
cites work: Solving propositional satisfiability problems
cites work: The Pure Literal Rule and Polynomial Average Time
description: scientific article; zbMATH DE number 710223