278 search results - page 28 / 56 » Algorithmic randomness and monotone complexity on product sp... |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
FSE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
SARA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
AAAI
2011
12 years 8 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
ICPP
2006
IEEE
14 years 2 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...