Computer Science – Computational Complexity
Scientific paper
2011-10-03
Computer Science
Computational Complexity
Scientific paper
Bulatov et al. [1] defined the operation of (efficient)
pps_\omega-definability in order to study the computational complexity of
certain approximate counting problems. They asked whether all log-supermodular
functions can be defined by binary implication and unary functions in this
sense. We give a negative answer to this question.
No associations
LandOfFree
LSM is not generated by binary functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with LSM is not generated by binary functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LSM is not generated by binary functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-271813