scientific article; zbMATH DE number 1834642
From MaRDI portal
Publication:4779137
zbMath0999.68205MaRDI QIDQ4779137
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360087
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Absorbing random walks and the NAE2SAT problem ⋮ Random walks for selected Boolean implication and equivalence problems ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
This page was built for publication:
