Sciweavers

SYNTHESE
2010
68views more  SYNTHESE 2010»
13 years 5 months ago
Informational versus functional theories of scientific representation
Recent work in the philosophy of science has generated an apparent conflict between theories attempting to explicate the nature of scientific representation. On one side, there are...
Anjan Chakravartty
ECCC
2010
117views more  ECCC 2010»
13 years 5 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
13 years 6 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko
JCB
2007
118views more  JCB 2007»
13 years 7 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
ITA
2006
163views Communications» more  ITA 2006»
13 years 7 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
CC
2006
Springer
147views System Software» more  CC 2006»
13 years 7 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
DIMVA
2004
13 years 8 months ago
Structural Comparison of Executable Objects
: A method to heuristically construct an isomorphism between the sets of functions in two similar but differing versions of the same executable file is presented. Such an isomorphi...
Halvar Flake
EUROCRYPT
2006
Springer
13 years 10 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
ISTCS
1997
Springer
13 years 11 months ago
Faster subtree isomorphism
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no
Ron Shamir, Dekel Tsur
LICS
2002
IEEE
14 years 15 hour ago
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat