Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Understanding the Hardness of Proving Formulas in Propositional Logic
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-2700-4285
2011 (English)Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2011.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-63102OAI: oai:DiVA.org:kth-63102DiVA: diva2:481628
Conference
Algebra and Geometry Seminar, Stockholm University, November 30, 2011
Note
QC 20120330Available from: 2012-01-21 Created: 2012-01-21 Last updated: 2012-03-30Bibliographically approved

Open Access in DiVA

No full text

Other links

http://www.csc.kth.se/~jakobn/research/TalkSU1111.pdf

Authority records BETA

Nordström, Jakob

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

urn-nbn

Altmetric score

urn-nbn
Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf