Title :
Counting Problems and Clones of Functions
Author :
Bulatov, Andrei A.
Author_Institution :
Simon Fraser Univ., Fraser, MI
Abstract :
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.
Keywords :
combinatorial mathematics; computational complexity; formal logic; clones of functions; combinatorial problems; counting problems; multi-valued logic; statistical physics; Application software; Cloning; Combinatorial mathematics; Computer science; Equations; Graph theory; Multivalued logic; Physics; Quantum computing; Quantum mechanics; clones; complexity; counting problems; multi-valued functions;
Conference_Titel :
Multiple-Valued Logic, 2009. ISMVL '09. 39th International Symposium on
Conference_Location :
Naha, Okinawa
Print_ISBN :
978-1-4244-3841-9
Electronic_ISBN :
0195-623X
DOI :
10.1109/ISMVL.2009.47
