By Topic

Counting Problems and Clones of Functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Andrei A. Bulatov ; Simon Fraser Univ., Fraser, MI

Counting solutions of various combinatorial problems is a well established and intensively studied area of theoretical computer science. Its applications range from networking to statistical physics. The central question in this area is the complexity of and algorithms for problems of this type. It turns out that in many important cases these questions can be answered with aid of certain clones of functions of multi-valued logic. We show the connection between the two areas and survey recent advances in this research direction.

Published in:

2009 39th International Symposium on Multiple-Valued Logic

Date of Conference:

21-23 May 2009