Proof Complexity of Resolution-Based Qbf Calculi

AuthID
 P-00A-7V5
3
Author(s)
Chew, L
·
1
Editor(s)
Mayr E.W.Ollinger N.
Document Type
Proceedings Paper
Year published
2015
Published
in Leibniz International Proceedings in Informatics, LIPIcs, ISSN: 1868-8969
Volume: 30, Pages: 76-89
Conference
32Nd International Symposium on Theoretical Aspects of Computer Science, Stacs 2015, Date: 4 March 2015 through 7 March 2015
Indexing
Scopus®
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-84923886977
Source Identifiers
ISSN: 1868-8969
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service