Sciweavers

13621 search results - page 59 / 2725
» Computability and Complexity in Self-assembly
Sort
View
IGPL
2000
82views more  IGPL 2000»
13 years 9 months ago
The Computational Complexity of Hybrid Temporal Logics
Carlos Areces, Patrick Blackburn, Maarten Marx
DAM
2002
82views more  DAM 2002»
13 years 9 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
IJFCS
2002
72views more  IJFCS 2002»
13 years 9 months ago
On the Complexity of Computing Values of Restricted Games
Jesús Mario Bilbao, J. R. Fernández,...