scientific article; zbMATH DE number 2086640
From MaRDI portal
Publication:4737176
zbMath1056.68130MaRDI QIDQ4737176
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800414.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
The complexity of constraint satisfaction games and QCSP ⋮ Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights ⋮ Majority constraints have bounded pathwidth duality ⋮ Recognizing frozen variables in constraint satisfaction problems ⋮ \(H\)-coloring dichotomy revisited
This page was built for publication:
