An Algebraic Model for Combinatorial Problems

DOI10.1137/S0097539793243004MaRDI QIDQ4877529zbMATH OpenOpenAlexFDO

Authors R. E. Stearns, H. 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)

Recommendations

• On the algebraic structure of combinatorial problems
• New constructs for the description of combinatorial optimization problems in algebraic modeling languages
• scientific article; zbMATH DE number 5575002
• scientific article; zbMATH DE number 1670830
• The complexity of constraint satisfaction: an algebraic approach

Cited in

(8)

• On the algebraic structure of combinatorial problems
• scientific article; zbMATH DE number 3847211 (Why is no real title available?)
• scientific article; zbMATH DE number 5139236 (Why is no real title available?)
• Algebras for combinatorial search
• Dynamic algorithms for graphs of bounded treewidth
• Combinatorics for the East model
• Semiring reasoning frameworks in AI and their computational complexity
• Optimal 2-constraint satisfaction via sum-product algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4877529)