Holant problems
Description: A class of computational problems in theoretical computer science involving counting weighted assignments that satisfy local constraints on graphs.
Primary topic: Advanced Graph Theory Research (81%)
OpenAlex ID: keywords/holant-problems
