Sciweavers

1698 search results - page 39 / 340
» Growing Complex Games
Sort
View
ILC
2007
Springer
15 years 3 months ago
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
Jacques Duparc, Alessandro Facchini
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 2 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
CARDIS
2006
Springer
109views Hardware» more  CARDIS 2006»
15 years 1 months ago
A Smart Card-Based Mental Poker System
On-line casinos have experienced a great expansion since the generalized use of Internet started. There exist in the literature several proposals of systems allowing secure remote ...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...
LICS
2008
IEEE
15 years 4 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
Pierre Chambart, Ph. Schnoebelen
IJAC
2007
73views more  IJAC 2007»
14 years 9 months ago
Computationally and Algebraically Complex Finite Algebra Membership Problems
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...
Marcin Kozik