A Polynomial Time Algorithm for Solving the Word-length Optimization Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Polynomial Time Algorithm for Solving the Word-length Optimization Problem

(1) , (2) , (1)
1
2
Not file

Dates and versions

hal-00876132 , version 1 (23-10-2013)

Identifiers

  • HAL Id : hal-00876132 , version 1

Cite

Karthick Parashar, Daniel Menard, Olivier Sentieys. A Polynomial Time Algorithm for Solving the Word-length Optimization Problem. IEEE/ACM International Conference on Computer-Aided Design (ICCAD), Nov 2013, San Diego, United States. ⟨hal-00876132⟩
299 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More