Revision as of 10:44, 8 July 2023 edit Jason Quinn (talk \| contribs) Autopatrolled, Administrators 43,842 edits and another ← Previous edit		Revision as of 10:45, 8 July 2023 edit undo Jason Quinn (talk \| contribs) Autopatrolled, Administrators 43,842 edits →References: using a cite template to match other refs Next edit →
Line 48: * {{cite journal \|last=O'Donnell \|first=Ryan \|year=2008 \|title=Some topics in analysis of Boolean functions \|journal=ECCC \|issn=1433-8092 \|url=https://eccc.weizmann.ac.il/report/2008/055/}} * {{cite conference \|last1=Rother \|first1=C. \|last2=Kolmogorov \|first2=V. \|last3=Lempitsky \|first3=V. \|last4=Szummer \|first4=M. \|year=2007 \|title=Optimizing Binary MRFs via Extended Roof Duality \|conference=[[Conference on Computer Vision and Pattern Recognition]] \|url=http://research.microsoft.com/pubs/67978/cvpr07-QPBOpi.pdf}} * ~~Alexander~~{{cite journal \|last=Schrijver. \|first=Alexander \|date=November 2000 \|title=A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. \|journal=Journal of Combinatorial Theory~~, Series~~ \|series=B~~, Volume~~ \|volume=80~~, Issue~~ \|issue=2~~, November 2000, Pages~~ \|pages=346-355.}} [[Category:Mathematical optimization]]

Pseudo-Boolean function: Difference between revisions