98 search results - page 3 / 20 » A note on weak dividing |
CIE
2005
Springer
14 years 1 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...
IACR
2011
12 years 7 months ago
2011
The Galois/Counter Mode (GCM) of operation has been standardized by NIST to provide single-pass authenticated encryption. The GHASH authentication component of GCM belongs to a cla...
SWAT
2010
Springer
14 years 16 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
INFORMATICALT
2006
13 years 7 months ago
2006
Abstract. Robust stability results for nominally linear hybrid systems are obtained from total stability theorems for purely continuous-time and discrete-time systems. The class of...
JSYML
2008
13 years 7 months ago
2008
The purpose of this note is to demonstrate that a weak form of club guessing on 1 implies the existence of an Aronszajn line with no Countryman suborders. An immediate consequence ...