2430 search results - page 455 / 486 » Computing Tutte Polynomials |
CC
2008
Springer
13 years 9 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
AI
2006
Springer
13 years 9 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
ALMOB
2006
13 years 9 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...