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

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

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

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

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

Locking based on a pairwise decomposition of the transaction systemLAUSEN, G.Discrete applied mathematics. 1992, Vol 40, Num 2, pp 217-236, issn 0166-218XArticle

Scheduling tree-structured tasks with restricted execution timesJIANZHONG DU; LEUNG, J. Y.-T.Information processing letters. 1988, Vol 28, Num 4, pp 183-188, issn 0020-0190Article

A realistic security analysis of identification schemes based on combinatorial problemsPOUPARD, G.European transactions on telecommunications. 1997, Vol 8, Num 5, pp 471-480, issn 1124-318XConference Paper

Automating Pólya theory: the computational complexity of the cycle index polynomialGOLDBERG, L. A.Information and computation (Print). 1993, Vol 105, Num 2, pp 268-288, issn 0890-5401Article

Simple LPO constraint solving methodsNIEUWENHUIS, R.Information processing letters. 1993, Vol 47, Num 2, pp 65-69, issn 0020-0190Article

An O(log*n) approximation algorithm for the asymmetric p-center problemPANIGRAHY, R; VISHWANATHAN, S.Journal of algorithms (Print). 1998, Vol 27, Num 2, pp 259-268, issn 0196-6774Conference Paper

Uet flow shop scheduling with delaysRAYWARD-SMITH, V. J; REBAINE, D.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 1, pp 23-30, issn 0988-3754Article

Algorithms for detecting morphic images of a wordNERAUD, J.Information and computation (Print). 1995, Vol 120, Num 1, pp 126-148, issn 0890-5401Article

On space-efficient algorithms for certain NP-complete problemsFERREIRA, A.Theoretical computer science. 1993, Vol 120, Num 2, pp 311-315, issn 0304-3975Article

Complexity of matching problemsBENANAV, D; DEEPAK KAPUR; PALIATH NARENDRAN et al.Journal of symbolic computation. 1987, Vol 3, Num 1-2, pp 203-216, issn 0747-7171Article

Single row routing on multilayersDINGLE, A; SUDBOROUGH, I. H.Journal of computer and system sciences (Print). 1995, Vol 50, Num 1, pp 126-131, issn 0022-0000Article

q-partitioning of graphs with finite coordination numberGOLDSCHMIDT, Y. Y; PINK-YIN LAI.Journal of physics. A, mathematical and general. 1988, Vol 21, Num 22, pp L1043-L1049, issn 0305-4470Article

A variable complexity norm maximization problemMANGASARIAN, O. L; SHIAU, T. -H.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 3, pp 455-461, issn 0196-5212Article

Inhomogeneities in the polynomial-time degrees: the degrees of super sparse setsAMBOS-SPIES, K.Information processing letters. 1986, Vol 22, Num 3, pp 113-117, issn 0020-0190Article

Sur la possibilité de construction des plans optimaux d'ordonnancement pour un système à plusieurs étapes avec des parcours non fixésSTRUSEVICH, V. A.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1986, Num 6, pp 43-48, issn 0002-3574Article

Power indices and easier hard problemsSTEARNS, R. E; HUNT, H. B.Mathematical systems theory. 1990, Vol 23, Num 4, pp 209-225, issn 0025-5661, 17 p.Article

Problem of optimizing the number of block accesses in performing relational join is NP-hardFARSHAD FOTOUHI; SAKTI PRAMANIK.Information processing letters. 1991, Vol 38, Num 5, pp 271-275, issn 0020-0190, 5 p.Article

Unit disk graphsCLARK, B. N; COLBOURN, C. J; JOHNSON, D. S et al.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 165-177, issn 0012-365X, 13 p.Article

Universal relations and #P-completenessFOURNIER, Hervé; MALOD, Guillaume.Lecture notes in computer science. 2006, pp 368-379, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper