Sciweavers

1222 search results - page 65 / 245
» corr 2008
Sort
View
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 6 months ago
On the random satisfiable process
In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas
Michael Krivelevich, Benny Sudakov, Dan Vilenchik
CORR
2008
Springer
81views Education» more  CORR 2008»
15 years 6 months ago
Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
Florian Horn, Hugo Gimbert
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 8 months ago
Small Turing universal signal machines
geometrical computation 4: small Turing universal signal machines J
Jérôme Durand-Lose
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 6 months ago
Digraph Decompositions and Monotonicity in Digraph Searching
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
Stephan Kreutzer, Sebastian Ordyniak
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 6 months ago
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
Barnaby Martin