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
A fast heuristic algorithm for disjoint decomposition of Boolean functions
Jönköping University, School of Engineering, JTH, Computer and Electrical Engineering.
Royal Institute of Technology, Stockholm.
Royal Institute of Technology, Stockholm.
2002 (Swedish)In: Proceeding of 11th International Workshop on Logic & Synthesis, 2002, p. 51-57Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2002. p. 51-57
Identifiers
URN: urn:nbn:se:hj:diva-6463OAI: oai:DiVA.org:hj-6463DiVA, id: diva2:37283
Available from: 2007-08-02 Created: 2007-08-02

Open Access in DiVA

No full text in DiVA

Authority records BETA

Bengtsson, Tomas

Search in DiVA

By author/editor
Bengtsson, Tomas
By organisation
JTH, Computer and Electrical Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 140 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