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
On complexity Boolean circuits for arithmetics operations in some composite binary fields
Karlstad University, Faculty of Technology and Science, Department of Mathematics.
2006 (English)In: Vestnik, Mosk. Universitet. Ser1. Math. N 5. pp.10-16Article in journal (Refereed)
Place, publisher, year, edition, pages
2006.
National Category
Mathematics
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:kau:diva-22035OAI: oai:DiVA.org:kau-22035DiVA: diva2:595711
Available from: 2013-01-21 Created: 2013-01-21 Last updated: 2013-01-21

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Gachkov, Igor
By organisation
Department of Mathematics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

Total: 43 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