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...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
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...
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...
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...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
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...