9842 search results - page 316 / 1969 » The Complexity of the Matching-Cut Problem |
160
click to vote
ATAL
2010
Springer
15 years 5 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...
128
click to vote
AH
2004
Springer
15 years 9 months ago
2004
Springer
: This paper presents an evaluation study that compares two different problem selection strategies for an Intelligent Tutoring System (ITS). The first strategy uses static problem ...
113
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
134
click to vote
MATES
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Cooperative problem solving without communication is an oftenstudied field within multi-agent research. Realistic problems investigated in this particular field are compl...
115
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...