4066 search results - page 3 / 814 » Almost Complete Sets |
CPC
1998
13 years 5 months ago
1998
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
CSJM
2006
13 years 6 months ago
2006
It is known that P systems with two membranes and minimal symport/antiport rules are "almost" computationally complete as generators of number or vector sets. Interpreti...
SIAMDM
2008
13 years 6 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
COMBINATORICS
2000
13 years 5 months ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...