Sciweavers

5493 search results - page 4 / 1099
» Effectively Polynomial Simulations
Sort
View
60
Voted
TVLSI
2008
72views more  TVLSI 2008»
14 years 9 months ago
Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra
Namrata Shekhar, Priyank Kalla, M. Brandon Meredit...
ENTCS
2002
61views more  ENTCS 2002»
14 years 9 months ago
Effectively Absolute Continuity and Effective Jordan Decomposability
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
Xizhong Zheng, Robert Rettinger, Burchard von Brau...
WSC
2008
14 years 12 months ago
Comparing designs for computer simulation experiments
The use of simulation as a modeling and analysis tool is wide spread. Simulation is an enabling tool for experimenting virtually on a validated computer environment. Often the und...
Rachel T. Johnson, Bradley Jones, John W. Fowler, ...
SIGACT
2010
74views more  SIGACT 2010»
14 years 8 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
15 years 6 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...