نتایج جستجو برای: isomorphism
تعداد نتایج: 9977 فیلتر نتایج به سال:
We study the complexity of the Subgraph Bisimulation Problem, which stands to Graph Bisimulation as Subgraph Isomorphism stands to Graph Isomorphism and we prove its NP-Completeness. Our analysis is motivated by its applications to Semistructured Databases.
We investigate the complexity of the syntactic isomorphism problem of CNF Boolean Formulas (CSFI): given two CNF Boolean formulas φ(a1, . . . , an) and φ(b1, . . . , bn) decide whether there exists a permutation of clauses, a permutation of literals and a bijection between their variables such that φ(a1, . . . , an) and φ(b1, . . . , bn) become syntactically identical. We first show that the CS...
We give a new upper bound for the Group and Quasigroup Isomorphism problems when the input structures are given explicitly by multiplication tables. We show that these problems can be computed by polynomial size nondeterministic circuits of unbounded fan-in with O(log log n) depth and O(log n) nondeterministic bits, where n is the number of group elements. This improves the existing upper bound...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید