Skip to Main content Skip to Navigation
Conference papers

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

Complete list of metadata

https://hal.inria.fr/hal-00876132
Contributor : Daniel Menard Connect in order to contact the contributor
Submitted on : Wednesday, October 23, 2013 - 5:32:18 PM
Last modification on : Tuesday, January 11, 2022 - 3:14:04 AM

Identifiers

  • HAL Id : hal-00876132, version 1

Citation

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⟩

Share

Metrics

Les métriques sont temporairement indisponibles