Equivalence Classes of Circuit Mutants for Experimental

A New Benchmarking Paradigm in EDA : Analysis of Equivalence Class Mutant Circuit

Today, typical experiments that report`performance' of EDA algorithms are based on isolated instances of circuit benchmarks. In this paper, we design and report results of experiments that use a large number of sample circuits from several equivalence classes. We consider a number of known circuit benchmarks and construct large samples of circuits that belong to the same equivalence class. Spec...

The graph of equivalence classes and Isoclinism of groups

‎Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$‎. ‎In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$‎, ‎where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$‎. ‎We introduce a new graph determined ...

Some equivalence classes of operators on B(H)

FUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS

In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...

Equivalence classes of clone circuits for physical-design benchmarking

To provide a better understanding of physical design algorithms and the underlying circuit architecture they are targeting, we need to exercise the algorithms and architectures with many benchmark circuits. The lack of existing benchmarks makes us consider the automatic generation of netlists. In this paper, we formally define the equivalence class of circuit “clones” of a given seed circuits, ...