STACS
13 years 10 months ago
1994 Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
STACS
13 years 10 months ago
1994 Springer STACS
13 years 10 months ago
1994 Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
STACS
13 years 10 months ago
1994 Springer |