Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A polynomial time algorithm for solving the word-length optimization problem."

Karthick Parashar, Daniel Ménard, Olivier Sentieys (2013)

> Home

Details and statistics

DOI: 10.1109/ICCAD.2013.6691183

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  authority control:
- export record
  dblp key:
  - conf/iccad/ParasharMS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/ParasharMS13
Karthick Parashar, Daniel Ménard, Olivier Sentieys:
A polynomial time algorithm for solving the word-length optimization problem. ICCAD 2013: 638-645

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.