82 search results - page 5 / 17 » mst 2006 |
108
click to vote
MST
2010
14 years 10 months ago
2010
Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
52
Voted
MST
2010
14 years 10 months ago
2010
Since Grover’s seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items x1, . . . , xn and we would like
100
Voted
MST
2010
14 years 10 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
MST
2007
14 years 11 months ago
2007
In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
111
click to vote
MST
2007
14 years 11 months ago
2007
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...