Natural self-reducible setsSELMAN, A. L.SIAM journal on computing (Print). 1988, Vol 17, Num 5, pp 989-996, issn 0097-5397Article

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

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

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

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

Hard enumeration problems in geometry and combinatoricsLINIAL, N.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 2, pp 331-335, issn 0196-5212Article

Complete divisibility problems for slowly utilized oraclesPLAISTED, D. A.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 245-260, issn 0304-3975Article

Input-output decomposition of dynamic systems is NP-completeTARJAN, R. E; PICHAI, V; SEZER, M. E et al.IEEE transactions on automatic control. 1984, Vol 29, Num 9, pp 863-864, issn 0018-9286Article

Modèles de calculs déterministesDIKOVSKIJ, A. YA.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 5, pp 84-105, issn 0002-3388Article

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 complexity of counting homeomorphsFARR, G; MCDIARMID, C.Theoretical computer science. 1985, Vol 36, Num 2-3, pp 345-348, issn 0304-3975Article

The complexity of completing partial latin squaresCOLBOURN, C. J.Discrete applied mathematics. 1984, Vol 8, Num 1, pp 25-30, issn 0166-218XArticle

The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-completeNARENDRAN, P; OTTO, F; WINKLMANN, K et al.Information and control. 1984, Vol 63, Num 1-2, pp 58-66, issn 0019-9958Article

Verifying nonrigidilyGORALCIK, P; KOUBEK, V.Information processing letters. 1986, Vol 22, Num 2, pp 91-95, issn 0020-0190Article

On the complexity of intersection and conjugacy problems in free groupsAVENHAUS, J; MADLENER, K.Theoretical computer science. 1984, Vol 32, Num 3, pp 278-295, issn 0304-3975Article

The NP-completeness column: An ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1984, Vol 5, Num 2, pp 284-299, issn 0196-6774Article

On the complexity of general graph factor problemsKIRKPATRICK, D. G; HELL, P.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 601-609, issn 0097-5397Article

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

Algorithmes ε-approchés efficaces d'optimisation des fonctionnelles multiplicativesKOVALEV, M. YA.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 4, pp 13-20, issn 0002-3574Article

Sur la complexité des problèmes de flots avec des contraintes sur la longueur des cheminsKUZ'MIN, S. L.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 4, pp 91-97, issn 0002-3388Article

On separating systems of graphsCAI MAO-CHENG.Discrete mathematics. 1984, Vol 49, Num 1, pp 15-20, issn 0012-365XArticle

Recognizing graphs with fixed interval number is NP-completeWEST, D. B; SHMOYS, D. B.Discrete applied mathematics. 1984, Vol 8, Num 3, pp 295-305, issn 0166-218XArticle

Two results on polynomial time truth-table reductions to sparse setsUKKONEN, E.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 580-587, issn 0097-5397Article