Change search
ReferencesLink to record
Permanent link

Direct link
On Proof Complexity Lower Bounds and Possible Connections to SAT Solving
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-2700-4285
2011 (English)Conference paper (Refereed)
Place, publisher, year, edition, pages
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-63104OAI: diva2:481635
Mathematical Logic: Proof Theory, Constructive Mathematics, Mathematisches Forschungsinstitut Oberwolfach, November 6–12, 2011
QC 20120124Available from: 2012-01-21 Created: 2012-01-21 Last updated: 2012-01-24Bibliographically approved

Open Access in DiVA

No full text

Other links


Search in DiVA

By author/editor
Nordström, Jakob
By organisation
Theoretical Computer Science, TCS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 45 hits
ReferencesLink to record
Permanent link

Direct link