SCHEDULING SUBJECT TO NONRENEWABLE-RESOURCE CONSTRAINTSCARLIER J; RINNOOY KAN AHG.1982; OPER. RES. LETT.; NLD; DA. 1982; VOL. 1; NO 2; PP. 52-55; BIBL. 5 REF.Article

FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME.HADLOCK F.1975; S.I.AM. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 221-225; BIBL. 8 REF.Article

SPARSE COMPLEX POLYNOMIALS AND POLYNOMIAL REDUCIBILITY.PLAISTED DA.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 2; PP. 210-221; BIBL. 4 REF.Article

COMPLETE SETS AND THE POLYNOMIAL-TIME HIERARCHY.WRATHALL C.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 23-33; BIBL. 13 REF.Article

RELATIVIZATIONS OF THE P=. NP QUESTION.BAKER T; GILL J; SOLOVAY R et al.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 4; PP. 431-442; BIBL. 10 REF.Article

THE COMPLEXITY OF DECISION PROBLEMS FOR FINITE-TURN MULTICOUNTER MACHINESGURARI EM; IBARRA OH.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 220-229; BIBL. 18 REF.Article

ON THE STRUCTURE OF SETS IN NP AND OTHER COMPLEXITY CLASSESLANDWEBER LH; LIPTON RJ; ROBERTSON EL et al.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 2; PP. 181-200; BIBL. 17 REF.Article

THE COMPLEXITY OF DECISION PROBLEMS FOR FINITE-TURN MULTICOUNTER MACHINESGURARI EM; IBARRA OH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 495-505; BIBL. 18 REF.Conference Paper

THE ELLIPSOID METHOD: A SURVEYBLAND RG; GOLDFARD D; TODD MJ et al.1981; OPER. RES.; ISSN 0030-364X; USA; DA. 1981; VOL. 29; NO 6; PP. 1039-1091; BIBL. 6 P.Article

RELATIVIZATION OF QUESTIONS ABOUT LOG SPACE COMPUTABILITY.LADNER RE; LYNCH NA.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976; VOL. 10; NO 1; PP. 19-32; BIBL. 22 REF.Article

ON THE STRUCTURE OF SETS IN NP AND OTHER COMPLEXITY GLASSESLANDWEBER LH; LIPTON R; ROBERTSON EL et al.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 661-669; BIBL. 16 REF.Conference Paper

COMPLEXITY OF LINEAR PROGRAMMINGTRAUB JF; WOZNIAKOWSKI H.1982; OPER. RES. LETT.; NLD; DA. 1982; VOL. 1; NO 2; PP. 59-62; BIBL. 12 REF.Article

COMPLETENESS, APPROXIMATION AND DENSITYKER I KO; MOORE D.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 787-796; BIBL. 16 REF.Article

POLYNOMIAL AND ABSTRACT SUBRECURSIVE CLASSES.MEHLHORN K.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 2; PP. 147-178; BIBL. 1 P. 1/2; (ANNU. ACM SYMP. THEORY COMPUT. 6; SEATTLE, WASH.; 1974)Conference Paper

ON GAMMA -REDUCIBILITY VERSUS POLYNOMIAL TIME MANY-ONE REDUCIBILITYLONG TJ.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 14; NO 1; PP. 91-101; BIBL. 6 REF.Article

P-COMPLETE PROBLEMS IN FREE GROUPSAVENHAUS J; MADLENER K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 42-51; BIBL. 5 REF.Conference Paper

TESTING FOR EQUALITY BETWEEN MAXIMUM MATCHING AND MINIMUM NODE COVERING.GAVRIL F.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 199-202; BIBL. 5 REF.Article

REMARKS ON THE COMPLEXITY OF NONDETERMINISTIC COUNTER LANGUAGES.GREIBACH SA.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 4; PP. 269-288; BIBL. 17 REF.Article

A POLYNOMIAL-TIME ALGORITHM FOR THE KNAPSACK PROBLEM WITH TWO VARIABLES.HIRSCHBERG DS; WONG CK.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 147-154; BIBL. 7 REF.Article

THE AVERAGE NUMBER OF PIVOT STEPS REQUIRED BY THE SIMPLEX-METHOD IS POLYNOMIALBORGWARDT KH.1982; Z. OPER. RES.; ISSN 0373-790X; DEU; DA. 1982; VOL. 26; NO 5; PP. 157-177; ABS. GER; BIBL. 24 REF.Article

ALGORITHME POLYNOMIAL DE RECHERCHE DES RECOUVREMENTS MINIMAUX DE SOMMETS POUR UNE CLASSE DE GRAPHES PLANAIRESKINBER EB.1980; IZVEST. VYSSH. UCHEBN. ZAVED., MAT.; SUN; DA. 1980; NO 1; PP. 75-77; BIBL. 4 REF.Article

RELATIVE COMPLEXITY OF CHECKING AND EVALUATING.VALIANT LG.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 1; PP. 20-23; BIBL. 12 REF.Article

A COMBINATORIAL PROBLEM WHICH IS COMPLETE IN POLYNOMIAL SPACE.EVEN S; TARJAN RE.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 4; PP. 710-719; BIBL. 10 REF.Article

COST-EFFECTIVE ALLOCATIONS OF BOUNDED AND BINARY RESOURCES IN POLYNOMIAL TIMEMJELDE KM.1982; EUROPEAN JOURNAL OF OPERATIONAL RESEARCH; ISSN 0377-2217; NLD; DA. 1982; VOL. 11; NO 2; PP. 176-180; BIBL. 12 REF.Article

COVERING EDGES BY CLIQUES WITH REGARD TO KEYWORD CONFLICTS AND INTERSECTION GRAPHS.KOU LT; STOCKMEYER LJ; WONG CK et al.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 2; PP. 135-139; BIBL. 10 REF.Article