27 search results - page 6 / 6 » Countable connected-homogeneous graphs |
ICCSA
2007
Springer
13 years 11 months ago
2007
Springer
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
JSYML
2007
13 years 5 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...