JCSS
2011
13 years 7 months ago
2011
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are i...
MLQ
2007
14 years 2 days ago
2007
Abstract. We prove the existence of pairs of models of the same cardinality λ which are very equivalent according to EF games, but not isomorphic. We continue the paper [4], but w...
COMBINATORICS
2002
14 years 12 days ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
COMBINATORICS
2000
14 years 12 days ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
GC
2007
Springer
14 years 15 days ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
JCT
2008
14 years 16 days ago
2008
A graph is pseudo 2
COMBINATORICS
2007
14 years 17 days ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
TLCA
2009
Springer
14 years 7 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...