Sciweavers

220 search results - page 22 / 44
» tcs 2008
Sort
View
TCS
2008
13 years 9 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
TCS
2008
13 years 9 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
TCS
2008
13 years 9 months ago
On varieties of meet automata
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
Ondrej Klíma, Libor Polák
TCS
2008
13 years 9 months ago
On periodicity of two-dimensional words
A two-dimensional word is a function on Z2 with finite number of values. The main problem we are interested in is periodicity of twodimensional words satisfying some local conditi...
S. A. Puzynina, Sergey V. Avgustinovich
TCS
2008
13 years 9 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum