256 search results - page 3 / 52 » Separation of NP-Completeness Notions |
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
CODCRY
2009
Springer
14 years 3 days ago
2009
Springer
We revisit two notions of difference between codewords, namely separation and the existence of small witnesses, and explore their links.
MST
2008
13 years 5 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
KBSE
2007
IEEE
13 years 11 months ago
2007
IEEE
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
ICCSA
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the ...