Sciweavers

2286 search results - page 158 / 458
» Algorithms for Categorical Equivalence
Sort
View
CSR
2009
Springer
15 years 4 months ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
15 years 3 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
ICALP
2004
Springer
15 years 3 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
89
Voted
ISCAS
1999
IEEE
126views Hardware» more  ISCAS 1999»
15 years 2 months ago
Applications of clone circuits to issues in physical-design
In a companion paper of this session [1] we formally defined the notion of equivalence classes of circuits which are physical clones of an existing benchmark seed circuit created ...
Michael D. Hutton, Jonathan Rose
EUROSYS
2011
ACM
14 years 1 months ago
Symbolic crosschecking of floating-point and SIMD code
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
Peter Collingbourne, Cristian Cadar, Paul H. J. Ke...