An Algebraic Model for Combinatorial Problems

DOI10.1137/S0097539793243004zbMath0844.68063OpenAlexW1964911363MaRDI QIDQ4877529

Richard E. Stearns, Harry B. III Hunt

Publication date: 18 August 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793243004

zbMATH Keywords

generalized satisfiability problemhierarchical specifications

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)

Related Items (2)

Optimal 2-constraint satisfaction via sum-product algorithms ⋮ Dynamic algorithms for graphs of bounded treewidth

This page was built for publication: An Algebraic Model for Combinatorial Problems