848 search results - page 3 / 170 » Randomness and the linear degrees of computability |
CIE
2005
Springer
15 years 6 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
JSYML
2006
15 years 1 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
108
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
—We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and rece...
115
click to vote
ALENEX
2010
15 years 2 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
COMCOM
2008
15 years 1 months ago
2008
People enjoy the convenience of on-line services, Automated Teller Machines (ATMs), and pervasive computing, but online environments, ATMs, and pervasive computing may bring many r...