An exponential lower bound on OBDD refutations for pigeonhole formulas

Find Full text
Thumbnail
Fulltext:
75198.pdf
Size:
162.0Kb
Format:
PDF
Description:
Author’s version preprint
Download
Publication year
2009
Author(s)
Heling-Tveretina, O.
Sinz, C.
Zantema, H.
Publisher
Athene : EPTCS
In
Electronic Proceedings in Theoretical Computer Science, (2009)Markakis, E.; Milis, I. (ed.), Proceedings of the 4th Athens Colloquium on Algorithms and Complexity ACAC 2009, pp. 13-21
ISSN
Annotation
4th Athens Colloquium on Algorithms and Complexity ACAC 2009 in Athens, Greece, 20 augustus 2009
Publication type
Article in monograph or in proceedings
Please use this identifier to cite or link to this item: https://hdl.handle.net/2066/75198   https://hdl.handle.net/2066/75198
Display more details

Upload full text

Use your RU credentials (u/z-number and password) to log in with SURFconext to upload a file for processing by the repository team.