1679 search results - page 79 / 336 » Strong order equivalence |
AML
2010
13 years 10 months ago
2010
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
MLG
2007
Springer
14 years 4 months ago
2007
Springer
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
We present a process algebraic intruder model for verifying a class of liveness properties of security protocols. For this class, the proposed intruder model is proved to be equiv...
JUCS
2002
13 years 9 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...