In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i 0, P/poly has ith-order scaled p3 -strong dimension 0. W...
The advantages of pattern-based programming have been well-documented in the sequential literature. However patterns have yet to make their way into mainstream parallel computing,...
Steven Bromling, Steve MacDonald, John Anvik, Jona...
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these te...
John Anvik, Steve MacDonald, Duane Szafron, Jonath...
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
With the advancement in technologies to locate individuals, there has been an emergence of information systems that link People-to-People-to-Geographical-Places, labeled P3Systems...