Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("NP COMPLETE PROBLEM")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3314

  • Page / 133
Export

Selection :

  • and

DOT-MATRIX LIQUID CRYSTAL DISPLAY FOR INFORMATION SYSTEMSKINUGAWA K; TORIYAMA K; TAKASAKA M et al.1983; HITACHI REVIEW; ISSN 0018-277X; JPN; DA. 1983; VOL. 32; NO 1; PP. 37-40; BIBL. 2 REF.Article

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

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

A LOWER BOUND FOR ON-LINE BIN PACKINGLIANG FM.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 76-79; BIBL. 2 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

CONCURRENCY CONTROL BY LOCKINGPAPADIMITRIOU CH.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 215-226; BIBL. 22 REF.Article

ON GENERALIZED MATCHING PROBLEMSHELL P; KIRKPATRICK DG.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 1; PP. 33-35; BIBL. 15 REF.Article

POSITIVE FIRST-ORDER LOGIC IS NP-COMPLETEKOZEN D.1981; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1981; VOL. 25; NO 4; PP. 327-332; BIBL. 18 REF.Article

THE NP-COMPLETENESS OF THE DOMINATING SET PROBLEM IN CUBIC PLANAR GRAPHSKIKUNO T; YOSHIDA N; KAKUDA Y et al.1980; TRANS. INST. ELECTRON. COMMUN. ENG. JPN., E; JPN; DA. 1980; VOL. 63; NO 6; PP. 443-444; BIBL. 7 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

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

PROBABILISTIC ANALYSIS FOR SIMPLE ONE- AND TWO-DIMENSIONAL BIN PACKING ALGORITHMSFREDERICKSON GN.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 4-5; PP. 156-161; BIBL. 13 REF.Article

NODE DELETION NP-COMPLETE PROBLEMSKRISHNAMOORTHY MS; NARSINGH DEO.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 619-625; BIBL. 11 REF.Article

  • Page / 133