882 search results - page 20 / 177 » On the Hardness of Graph Isomorphism |
COCO
2010
Springer
14 years 16 days ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
13 years 8 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
ORDER
2000
13 years 8 months ago
2000
We prove that, given a nontrivial Boolean algebra B, a compact convex set S and a group G, there is an orthomodular lattice L with the center isomorphic to B, the automorphism grou...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...