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

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

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

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

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

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

On representations of algebraic-geometric codes for list decodingGURUSWAMI, V; SUDAN, M.Lecture notes in computer science. 2000, pp 244-255, issn 0302-9743, isbn 3-540-41004-XConference Paper

Factoring N = p^r q for large rBONEH, D; DURFEE, G; HOWGRAVE-GRAHAM, N et al.Lecture notes in computer science. 1999, pp 326-337, issn 0302-9743, isbn 3-540-66347-9Conference Paper

Can statistical zero knowledge be made non-interactive or on the relationship of SZK and NISZKGOLDREICH, O; SAHAI, A; VADHAN, S et al.Lecture notes in computer science. 1999, pp 467-484, issn 0302-9743, isbn 3-540-66347-9Conference Paper

Lower bounds for monotone real circuit depth and formula size and tree-like Cutting PlanesJOHANNSEN, J.Information processing letters. 1998, Vol 67, Num 1, pp 37-41, issn 0020-0190Article

Multilist layering : complexity and applicationsDESSMARK, A; LINGAS, A; ANIL MAHESHWARI et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 337-350, issn 0304-3975Article

A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixedAGARWALA, R; FERNANDEZ-BACA, D.SIAM journal on computing (Print). 1994, Vol 23, Num 6, pp 1216-1224, issn 0097-5397Article

On zero error algorithms having oracle access to one queryCAI, Jin-Yi; CHAKARAVARTHY, Venkatesan T.Journal of combinatorial optimization. 2006, Vol 11, Num 2, pp 189-202, issn 1382-6905, 14 p.Article

An efficient implementation of a joint generation algorithmBOROS, E; ELBASSIONI, K; GURVICH, V et al.Lecture notes in computer science. 2004, pp 114-128, issn 0302-9743, isbn 3-540-22067-4, 15 p.Conference Paper

Small spans in scaled dimensionHITCHCOCK, John M.IEEE Conference on Computational Complexity. 2004, pp 104-112, isbn 0-7695-2120-7, 1Vol, 9 p.Conference Paper