kw.\*:(%22PROBLEME NP COMPLET%22)
Results 1 to 25 of 20199
Selection :
Natural self-reducible setsSELMAN, A. L.SIAM journal on computing (Print). 1988, Vol 17, Num 5, pp 989-996, issn 0097-5397Article
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
The minimal logically-defined NP-complete problemBARBANCHON, Régis; GRANDJEAN, Etienne.Lecture notes in computer science. 2004, pp 338-349, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper
The NP-completeness column: an ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1984, Vol 5, Num 3, pp 433-447, issn 0196-6774Article
The NP-completeness column: an ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1983, Vol 4, Num 3, pp 286-300, issn 0196-6774Article
About recognizing (α, β) classes of polar graphsCHERNYAK, Z. A; CHERNYAK, A. A.Discrete mathematics. 1986, Vol 62, Num 2, pp 133-138, issn 0012-365XArticle
Verifying nonrigidilyGORALCIK, P; KOUBEK, V.Information processing letters. 1986, Vol 22, Num 2, pp 91-95, issn 0020-0190Article
An approximation algorithm for maximum packing of 3-edge pathsHASSIN, R; RUBINSTEIN, S.Information processing letters. 1997, Vol 63, Num 2, pp 63-67, issn 0020-0190Article
On the topological size of p-m-complete degreesZIMAND, M.Theoretical computer science. 1995, Vol 147, Num 1-2, pp 137-147, issn 0304-3975Article
On the complexity of quadratic programming in real number models of computationMEER, K.Theoretical computer science. 1994, Vol 133, Num 1, pp 85-94, issn 0304-3975Conference Paper
Three-dimensional stable matching problemsCHENG NG; HIRSCHBERG, D. S.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 2, pp 245-252, issn 0895-4801Article
Computational complexity of art gallery problemsLEE, D. T; LIN, A. K.IEEE transactions on information theory. 1986, Vol 32, Num 2, pp 276-282, issn 0018-9448Article
The NP-completeness column: An ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1984, Vol 5, Num 2, pp 284-299, issn 0196-6774Article
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
On the approximation of longest common nonsupersequences and shortest common nonsubsequencesZHANG, L.Theoretical computer science. 1995, Vol 143, Num 2, pp 353-362, issn 0304-3975Article
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
BLOCKSUM is NP-Complete : New Trends in Algorithms and Theory of ComputationHARAGUCHI, Kazuya; ONO, Hirotaka.IEICE transactions on information and systems. 2013, Vol 96, Num 3, pp 481-488, issn 0916-8532, 8 p.Article
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
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