2000 character limit reached
LSM is not generated by binary functions (1110.0461v2)
Published 3 Oct 2011 in cs.CC
Abstract: The material in this note is now superseded by arXiv:1108.5288v4. 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.