99 search results - page 7 / 20 » On a class of finite symmetric graphs |
DLOG
2011
12 years 12 months ago
2011
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
ECCC
2010
13 years 5 months ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
COMBINATORICS
2007
13 years 8 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
CONCUR
2000
Springer
14 years 1 days ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...