Sciweavers

896 search results - page 40 / 180
» On completeness of word reversing
Sort
View
133
Voted
FMCAD
2008
Springer
15 years 2 months ago
Word-Level Sequential Memory Abstraction for Model Checking
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
Per Bjesse
83
Voted
CORR
2008
Springer
162views Education» more  CORR 2008»
15 years 23 days ago
Compressed Modular Matrix Multiplication
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
ENTCS
2007
104views more  ENTCS 2007»
15 years 19 days ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...
MFCS
2005
Springer
15 years 6 months ago
Dimension Is Compression
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
María López-Valdés, Elvira Ma...
CDES
2008
130views Hardware» more  CDES 2008»
15 years 2 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Multi-Output Incompletely Specified Boolean Functions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...