LSM is not generated by binary functions
Abstract
The material in this note is now superseded by arXiv:1108.5288v4. Bulatov et al. [1] defined the operation of (efficient) ppsω-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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.