Resource Bounded Frequency Computations with Three ErrorsHERTRAMPF, Ulrich; MINNAMEIER, Christoph.Algorithmica. 2010, Vol 56, Num 3, pp 342-363, issn 0178-4617, 22 p.Article

On the power of deterministic reductions to C=PGREEN, F.Mathematical systems theory. 1993, Vol 26, Num 2, pp 215-233, issn 0025-5661Article

Roll cutting in the curtain industry, or : A well-solvable allocation problem : Cutting and PackingALFIERI, Arianna; VAN DE VELDE, Steef; WOEGINGER, Gerhard J et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1397-1404, issn 0377-2217, 8 p.Article

A polynomial-time algorithm for near-unanimity graphsLAROSE, Benoit; LOTEN, Cynthia; ZADORI, Laszlo et al.Journal of algorithms (Print). 2005, Vol 55, Num 2, pp 177-191, issn 0196-6774, 15 p.Article

Polynomial-time learnability from entailmentRAO, M. R. K. Krishna.Lecture notes in computer science. 2003, pp 489-491, issn 0302-9743, isbn 3-540-20642-6, 3 p.Conference Paper

Variable minimal unsatisfiabilityZHENYU CHEN; DECHENG DING.Lecture notes in computer science. 2006, pp 262-273, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 12 p.Conference Paper

Simple characterizations of P(#P) and complete problemsTODA, S.Journal of computer and system sciences (Print). 1994, Vol 49, Num 1, pp 1-17, issn 0022-0000Article

A new asymmetric pyramidally solvable class of the traveling salesman problemMOHAMMED FAZLE BAKI.Operations research letters. 2006, Vol 34, Num 6, pp 613-620, issn 0167-6377, 8 p.Article

Scheduling time-dependent jobs under mixed deteriorationGAWIEJNOWICZ, Stanislaw; LIN, Bertrand M. T.Applied mathematics and computation. 2010, Vol 216, Num 2, pp 438-447, issn 0096-3003, 10 p.Article

The shortest multipaths problem in a capacitated dense channelBENTZ, Cédric; COSTA, Marie-Christine; PICOULEAU, Christophe et al.European journal of operational research. 2007, Vol 178, Num 3, pp 926-931, issn 0377-2217, 6 p.Article

Small fast universal Turing machinesNEARY, Turlough; WOODS, Damien.Theoretical computer science. 2006, Vol 362, Num 1-3, pp 171-195, issn 0304-3975, 25 p.Article

An arithmetic for polynomial-time computationSCHWICHTENBERG, Helmut.Theoretical computer science. 2006, Vol 357, Num 1-3, pp 202-214, issn 0304-3975, 13 p.Conference Paper

On the fg-coloring of graphsNAKANO, S; NISHIZEKI, T; SAITO, N et al.Combinatorica (Print). 1990, Vol 10, Num 1, pp 67-80, issn 0209-9683, 14 p.Article

Finding Hamiltonian cycles in {quasi-claw, K_1,5, K_1,5+ e}-free graphs with bounded Dilworth numbersRAO LI.Discrete mathematics. 2009, Vol 309, Num 8, pp 2555-2558, issn 0012-365X, 4 p.Article

Reducibilities on tally and sparse setsSHOUWEN TANG; BOOK, R. V.Informatique théorique et applications (Imprimé). 1991, Vol 25, Num 3, pp 293-302, issn 0988-3754, 10 p.Article

A well-solvable special case of the bounded knapsack problemDEINEKO, Vladimir G; WOEGINGER, Gerhard J.Operations research letters. 2011, Vol 39, Num 2, pp 118-120, issn 0167-6377, 3 p.Article

On the construction of a family of transversal subspaces over finite fieldsCHISTOV, Alexander; FOURNIER, Herve; KOIRAN, Pascal et al.Linear algebra and its applications. 2008, Vol 429, Num 2-3, pp 589-600, issn 0024-3795, 12 p.Article

Bimatroidal independance systemsCRAMA, Y; HAMMER, P. L.Zeitschrift für Operations Research. 1989, Vol 33, Num 3, pp 149-165, issn 0373-790X, 17 p.Article

An algorithm for a super-stable roommates problemFLEINER, Tamas; IRVING, Robert W; MANLOVE, David F et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 7059-7065, issn 0304-3975, 7 p.Article

Stable sets of maximum weight in (P₇, banner)-free graphsMOSCA, Raffaele.Discrete mathematics. 2008, Vol 308, Num 1, pp 20-33, issn 0012-365X, 14 p.Article

Known and new classes of generalized Horn formulae with polynomial recognition and SAT tesflngCEPEK, Ondrej; KUCERA, Petr.Discrete applied mathematics. 2005, Vol 149, Num 1-3, pp 14-52, issn 0166-218X, 39 p.Article

On the structure of bounded queries to arbitrary NP setsCHANG, R.SIAM journal on computing (Print). 1992, Vol 21, Num 4, pp 743-754, issn 0097-5397Article

Some Results on Matchgates and Holographic AlgorithmsCAI, Jin-Yi; CHOUDHARY, Vinay.Lecture notes in computer science. 2006, pp 703-714, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

On α-redundant vertices in P₅-free graphsBRANDSTÄDT, Andreas; LE, Hoang-Oanh; VAN BANG LE et al.Information processing letters. 2002, Vol 82, Num 3, pp 119-122, issn 0020-0190Article

Recognition and dualization of disguised bidual Horn functionsEITER, Thomas; IBARAKI, Toshihide; MAKINO, Kazuhisa et al.Information processing letters. 2002, Vol 82, Num 6, pp 283-291, issn 0020-0190Article