J. Buresh-Oppenheim is an author at University of Toronto specializing in formal methods, automated reasoning, and formal verification.
Top concepts
EngineeringFormal MethodsComputer ScienceAutomated ReasoningFormal VerificationComputational ComplexityProof ComplexitySatisfiabilityDiscrete MathematicsCombinatorial Optimization
Publications per year
2003–2006
5
5
Rank bounds and integrality gaps for cutting planes procedures
J. Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory et al. · 2004 · 57 citations
Mathematical Programming, Numerical Analysis, Engineering +24
J. Buresh-Oppenheim, Rahul Santhanam · 2006 · 14 citations
Circuit Complexity, Computational Complexity Theory, Engineering +19
Rows per page
1–5 of 5