Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities

Kojevnikov, Arist

doi:10.1007/978-3-540-72788-0_10

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities

MPS-Authors

/persons/resource/persons235590

Kojevnikov, Arist
Max Planck Institute for Mathematics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kojevnikov, A. (2007). Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. In Theory and Applications of Satisfiability Testing – SAT 2007: proceedings (pp. 70-79). Heidelberg [et al.]: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-0004-2B6F-1

Abstract

There is no abstract available