BIPOLAR ICS AND DISCRETE DEVICES FOR OFFICE AUTOMATION EQUIPMENTIGUCHI S; MUROFUSHI F.1983; HITACHI REVIEW; ISSN 0018-277X; JPN; DA. 1983; VOL. 32; NO 1; PP. 49-52; BIBL. 3 REF.Article

HIGH-RESOLUTION COLOR DISPLAY TUBES FOR DISPLAY TERMINALSYOSHIDA H; YAMAZAKI E.1983; HITACHI REVIEW; ISSN 0018-277X; JPN; DA. 1983; VOL. 32; NO 1; PP. 33-36; BIBL. 2 REF.Article

ON THE COMPLEXITY OF LOCATING LINEAR FACILITIES IN THE PLANEMEGIDDO N; TAMIR A.1982; OPERATIONS RESEARCH LETTERS; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 5; PP. 194-197; BIBL. 9 REF.Article

A 5/4 ALGORITHM FOR TWO-DIMENSIONAL PACKINGBAKER BS; BROWN DJ; KATSEFF HP et al.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 4; PP. 348-368; BIBL. 4 REF.Article

BOUNDING THE BANDWIDTH OF NP-COMPLETE PROBLEMSMONIEN B; SUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 279-292; BIBL. 15 REF.Conference Paper

NEW ALGORITHMS FOR BIN PACKINGCHI CHIHYAO A.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 2; PP. 207-227; BIBL. 11 REF.Article

A GOOD SUBMATRIX IS HARD TO FINDBARTHOLDI JJ III.1982; OPERATIONS RESEARCH LETTERS; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 5; PP. 190-193; BIBL. 15 REF.Article

BACKTRACKING WITH MULTI-LEVEL DYNAMIC SEARCH REARRANGEMENTPURDOM PW JR; BROWN CA; ROBERTSON EL et al.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 2; PP. 99-113; BIBL. 13 REF.Article

COMPUTING THE MINIMUM FILL-IN IS NP-COMPLETEYANNAKAKIS M.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 1; PP. 77-79; BIBL. 6 REF.Article

THE NP-COMPLETENESS OF EDGE-COLORINGHOLYER I.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 718-720; BIBL. 4 REF.Article

SOME NP-COMPLETE PROBLEMS SIMILAR TO GRAPH ISOMORPHISMLUBIW A.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 11-21; BIBL. 16 REF.Article

THE NP-COMPLETENESS COLUMN: AN ONGOING GUIDEJOHNSON DS.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 4; PP. 393-405; BIBL. 71 REF.Article

WIELOMIANOWE I PSEUDOWIELOMIANOWE ALGORYTMY ROZWIAZYWANIA PROBLEMOW KOMBINATORYCZNYCH = ALGORITHMES POLYNOMIAUX ET PSEUDOPOLYNOMIAUX POUR RESOUDRE DES PROBLEMES COMBINATOIRESBLAZEWICZ J.1980; ARCH. AUTOM. TELEMECH.; ISSN 0004-072X; POL; DA. 1980; VOL. 25; NO 3; PP. 355-366; ABS. RUS/ENG; BIBL. 14 REF.Article

THE NP-COMPLETENESS OF THE HAMILTONIAN CYCLE PROBLEM IN PLANAR DIGRAPHS WITH DEGREE BOUND TOPLESNIK J.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 199-201; BIBL. 7 REF.Article

HIDING INFORMATION AND SIGNATURES IN TRAPDOOR KNAPSACKSMERKLE RC; HELLMAN ME.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 5; PP. 525-530; BIBL. 14 REF.Article

ON THE COMPLEXITY OF THE ONE-TERMINAL NETWORK DESIGN PROBLEM = SUR LA COMPLEXITE DU PROBLEME DE CONCEPTION D'UN RESEAU A UN TERMINALMEGIDDO N.1982; OPER. RES. LETT.; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 3; PP. 105-107; BIBL. 3 REF.Article

A NOTE ON SPARSE ORACLES FOR NPLONG TJ.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 224-232; BIBL. 12 REF.Article

COMPUTING A PERFECT STRATEGY FOR N X N CHESS REQUIRES TIME EXPONENTIAL IN NFRAENKEL AS; LICHTENSTEIN D.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 278-293; BIBL. 10 REF.Conference Paper

EDGE-DELETION PROBLEMSYANNAKAKIS M.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 2; PP. 297-309; BIBL. 16 REF.Article

IRREDUCIBLE POLYNOMIALS WITH INTEGRAL COEFFICIENTS HAVE SUCCINCT CERTIFICATESCANTOR DG.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 4; PP. 385-392; BIBL. 9 REF.Article

THE COMPLEXITY OF TESTING WHETHER A GRAPHS IS A SUPERCONCENTRATORBLUM M; KARP RM; VORNBERGER O et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 164-167; BIBL. 8 REF.Article

LE PROBLEME D'ETOILES POUR GRAPHES EST NP-COMPLETLALONDE F.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 3; PP. 271-280; BIBL. 6 REF.Article

ON THE COMPLEXITY OF STEINER-LIKE PROBLEMSCAMERINI PM; GALBIATI G; MAFFIOLI F et al.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 969-977; BIBL. 6 REF.Conference Paper

THE NP-COMPLETENESS OF SOME EDGE-PARTITION PROBLEMSHOLYER I.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 713-717; BIBL. 3 REF.Article

A DEFINITION OF THE P=NP-PROBLEM IN CATEGORIESHUWIG H.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 146-153; BIBL. 14 REF.Conference Paper