2218 search results - page 15 / 444 » Testing Expressibility Is Hard |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
COMPGEOM
2010
ACM
14 years 22 days ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
PPPJ
2006
ACM
14 years 1 months ago
2006
ACM
The JavaTM programming language is primarily used for platform-independent programming. Yet it also offers many productivity, maintainability and performance benefits for platfo...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
HICSS
2000
IEEE
14 years 2 days ago
2000
IEEE
Distributed multithreaded software systems are becoming more and more important in modern networked environment. For these systems, concurrency control and thread synchronization ...