A lower bound on the sample size needed to perform a significant frequent pattern mining taskJACQUEMONT, Stéphanie; JACQUENET, François; SEBBAN, Marc et al.Pattern recognition letters. 2009, Vol 30, Num 11, pp 960-967, issn 0167-8655, 8 p.Article

New lower bounds for seven classical Ramsey numbers R(3, q)KANG WU; WENLONG SU; HAIPENG LUO et al.Applied mathematics letters. 2009, Vol 22, Num 3, pp 365-368, issn 0893-9659, 4 p.Article

An improved lower bound for a bi-criteria scheduling problemJIN YAN.Operations research letters. 2008, Vol 36, Num 1, pp 57-60, issn 0167-6377, 4 p.Article

A new lower bound for the non-oriented two-dimensional bin-packing problemCLAUTIAUX, Francois; JOUGLET, Antoine; EL HAYEK, Joseph et al.Operations research letters. 2007, Vol 35, Num 3, pp 365-373, issn 0167-6377, 9 p.Article

On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problemsUMA, R. N; WEIN, Joel; WILLIAMSON, David P et al.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 241-256, issn 0304-3975, 16 p.Article

Geometric global quantum discordJIANWEI XU.Journal of physics. A, Mathematical and theoretical (Print). 2012, Vol 45, Num 40, issn 1751-8113, 405304.1-405304.9Article

Non-separating cocircuits in binary matroidsLEMOS, Manoel.Linear algebra and its applications. 2004, Vol 382, pp 171-178, issn 0024-3795, 8 p.Article

THE DEHN FUNCTIONS OF Out(F_n) AND Aut(F_n)BRIDSON, Martin R; VOGTMANN, Karen.Annales de l'Institut Fourier. 2012, Vol 62, Num 5, pp 1811-1817, issn 0373-0956, 7 p.Article

Lower bound on the number of toffoli gates in a classical reversible circuit through quantum information conceptsPOPESCU, Sandu; GROISMAN, Berry; MASSAR, Serge et al.Physical review letters. 2005, Vol 95, Num 12, pp 120503.1-120503.4, issn 0031-9007Article

On the Number of 1-Perfect Binary Codes : A Lower BoundKROTOV, Denis S; AVGUSTINOVICH, Sergey V.IEEE transactions on information theory. 2008, Vol 54, Num 4, pp 1760-1765, issn 0018-9448, 6 p.Article

A new lower bound for a rational approximation on the positive real axisGILEWICZ, Jacek; SHULIMANOV, Peter A.Journal of computational and applied mathematics. 2001, Vol 133, Num 1-2, pp 383-385, issn 0377-0427Conference Paper

On almost bad Boolean basesSTETSENKO, V.Theoretical computer science. 1994, Vol 136, Num 2, pp 419-469, issn 0304-3975Article

Comment: Improvement of Weyl's Inequality. By M. G. Marmorino et alMARMORINO, M. G.Journal of mathematical chemistry. 2007, Vol 41, Num 3, pp 327-327, issn 0259-9791, 1 p.Article

A Lower Bound for Scheduling MechanismsCHRISTODOULOU, George; KOUTSOUPIAS, Elias; VIDALI, Angelina et al.Algorithmica. 2009, Vol 55, Num 4, pp 729-740, issn 0178-4617, 12 p.Article

Differential inequalities for the positive zeros of Bessel functionsIFANTIS, E. K; SIAFARIKAS, P. D.Journal of computational and applied mathematics. 1990, Vol 30, Num 2, pp 139-143, issn 0377-0427, 5 p.Article

Secret Sharing and Non-Shannon Information InequalitiesBEIMEL, Amos; ORLOV, Ilan.IEEE transactions on information theory. 2011, Vol 57, Num 9, pp 5634-5649, issn 0018-9448, 16 p.Article

A NEAR-OPTIMAL SEPARATION OF REGULAR AND GENERAL RESOLUTIONURQUHART, Alasdair.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 107-121, issn 0097-5397, 15 p.Article

Lower Bounds for the Empirical Minimization AlgorithmMENDELSON, Shahar.IEEE transactions on information theory. 2008, Vol 54, Num 8, pp 3797-3803, issn 0018-9448, 7 p.Article

Lower bounds for binary codes of covering radius oneHAAS, Wolfgang.IEEE transactions on information theory. 2007, Vol 53, Num 8, pp 2880-2881, issn 0018-9448, 2 p.Article

A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations : Project management and schedulingBIANCO, Lucio; CARAMIA, Massimiliano.Computers & operations research. 2011, Vol 38, Num 1, pp 14-20, issn 0305-0548, 7 p.Article

Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardinessSCHALLER, Jeffrey.European journal of operational research. 2009, Vol 197, Num 1, pp 422-426, issn 0377-2217, 5 p.Article

Maximal rank of m × n × (mn-k) tensorsBSHOUTY, N. H.SIAM journal on computing (Print). 1990, Vol 19, Num 3, pp 467-471, issn 0097-5397, 5 p.Article

On the lower bounds for the norms of Cauchy-Toeplitz and Cauchy-Hankel matricesHONGLIN WU.Applied mathematics and computation. 2008, Vol 205, Num 1, pp 391-395, issn 0096-3003, 5 p.Conference Paper

A lower bound for the CO-irredundance number of a graphFINBOW, S.Discrete mathematics. 2005, Vol 295, Num 1-3, pp 49-62, issn 0012-365X, 14 p.Article

Lower bounds for the norms of Cauchy-Toeplitz and Cauchy-Hankel matricesGÜNGÖR, A. Dilek.Applied mathematics and computation. 2004, Vol 157, Num 3, pp 599-604, issn 0096-3003, 6 p.Article