BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Portugal
1 × USA
Collaborated with:
D.G.Mitchell
Talks about:
minimum (2) unsatisfi (1) polynomi (1) resolut (1) refut (1) time (1) cnfs (1) wit (1) cnf (1)

Person: Joshua Buresh-Oppenheim

DBLP DBLP: Buresh-Oppenheim:Joshua

Contributed to:

SAT 20072007
SAT 20062006

Wrote 2 papers:

SAT-2007-Buresh-OppenheimM #polynomial
Minimum 2CNF Resolution Refutations in Polynomial Time (JBO, DGM), pp. 300–313.
SAT-2006-Buresh-OppenheimM #satisfiability
Minimum Witnesses for Unsatisfiable 2CNFs (JBO, DGM), pp. 42–47.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.