LSM is not generated by binary functions

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-271813

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.