58 search results - page 2 / 12 » Almost Every Domain is Universal |
IFIP
1999
Springer
14 years 3 months ago
1999
Springer
: In a relatively short period of time, educational technology has become a basic component of the instructional life of almost every College or University around the world. The wa...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
MCU
2004
14 years 7 days ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
IPL
2006
13 years 10 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...