9842 search results - page 257 / 1969 » The Complexity of the Matching-Cut Problem |
101
Voted
DS
1997
15 years 1 months ago
1997
This paper motivates a comprehensive methodological framework for dealing with some aspects of real-world complexity in information system analysis and design. By complex applicat...
131
Voted
PODS
2012
ACM
13 years 3 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
85
Voted
MFCS
1989
Springer
15 years 4 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
104
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
104
Voted
CAV
2008
Springer
15 years 2 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...