- Publications
- Search
- Statistics
Proof Complexity of Resolution-Based Qbf Calculi
AuthID
P-00A-7V5
P-00A-7V5
3
Author(s)
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
Publication Identifiers
Scopus: 2-s2.0-84923886977
Source Identifiers
ISSN: 1868-8969
Export Publication Metadata
Publication Export Settings
Marked List
Citations
Oops! It looks like you don't have access to this content.
This section is restricted to uses with b-on access.
CORE Conference
No information about CORE Rank
During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.
TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.
Journal Factors
Oops! It looks like you don't have access to this content.
This section is restricted to uses with b-on access.
Info
At this moment we don't have any links to full text documens.