Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Covering problem")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1114

  • Page / 45
Export

Selection :

  • and

A covering problem over finite ringsNAKAOKA, I. N; DOS SANTOS, O. J. N. T. N.Applied mathematics letters. 2010, Vol 23, Num 3, pp 322-326, issn 0893-9659, 5 p.Article

On a New Relative Invariant Covering DimensionGEORGIOU, D. N; MEGARITIS, A. C.Extracta mathematicae. 2010, Vol 25, Num 3, pp 263-275, issn 0213-8743, 13 p.Conference Paper

When is a Group Homomorphism a Covering Homomorphism?SANTOS, José Carlos.Extracta mathematicae. 2007, Vol 22, Num 3, pp 325-330, issn 0213-8743, 6 p.Article

On odd covering systems with distinct moduliSONG GUO; SUN, Zhi-Wei.Advances in applied mathematics (Print). 2005, Vol 35, Num 2, pp 182-187, issn 0196-8858, 6 p.Article

Zur Eindeutigkeit volumenminimaler Ellipsoidüberdeckungen = About uniqueness of minimal volume ellipsoidal coveringsJUHNKE, F.Wissenschaftliche Zeitschrift der Technischen Hochschule Otto von Guericke Magdeburg. 1989, Vol 33, Num 6, pp 67-69, issn 0541-8933, 3 p.Article

Fractional covers for forests and matchingsPADBERG, M. W; WOLSEY, L. A.Mathematical programming. 1984, Vol 29, Num 1, pp 1-14, issn 0025-5610Article

COVERS IN FINITELY ACCESSIBLE CATEGORIESCRIVEI, Septimiu; PREST, Mike; TORRECILLAS, Blas et al.Proceedings of the American Mathematical Society. 2010, Vol 138, Num 4, pp 1213-1221, issn 0002-9939, 9 p.Article

A unified approach to approximating partial covering problemsKÖNEMANN, Jochen; PAREKH, Ojas; SEGEV, Danny et al.Lecture notes in computer science. 2006, pp 468-479, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Minimal models of covering spaces of P2 branched along two nonsingular curves with normal crossingsYAMAMOTO, S.Journal of pure and applied algebra. 1991, Vol 73, Num 1, pp 91-104, issn 0022-4049Article

Algorithmes optimaux de résolution des problèmes de configuration et de recouvrement des figures polygonales planesNOSOV, L. V; NOSOVA, E. G; RABINOVICH, E. B et al.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 4, pp 28-36, issn 0002-3574Article

Recouvrements d'un rectangle de largeur 3 à l'aide de triminos = Tilings of a rectangle of width 3 with triminoesKREWERAS, G.Mathématiques, informatique et sciences humaines. 1995, Num 130, pp 27-31, issn 0995-2314Article

The reduction of a double covering of a Mumford curveVAN STEEN, G.Bulletin of the Belgian Mathematical Society. Simon Stevin. 1994, Vol 1, Num 4, pp 469-475, issn 1370-1444Article

Surjections and coveringsCHANG, L; POE, A. T.International journal of computer & information sciences. 1984, Vol 13, Num 6, pp 509-520, issn 0091-7036Article

Kirkman covering designs with even-sized holesJIANXING YIN; CHENGMIN WANG.Discrete mathematics. 2009, Vol 309, Num 6, pp 1422-1434, issn 0012-365X, 13 p.Article

Application des diagrammes de Voronoi dans les problèmes combinatoires (revue)AKIMOVA, I. YA.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 2, pp 102-109, issn 0002-3388Article

A surprising covering of the real lineKUN, Gabor.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 12, pp 3555-3559, issn 0002-9939, 5 p.Article

An additive optimum covering problemSABIRYANOVA, K. G.Computational mathematics and mathematical physics. 1996, Vol 36, Num 4, pp 545-551, issn 0965-5425Article

An algorithm to find minimal cover of a set of functional dependenciesSAXENA, P. C; TRIPATHI, R. C.Computers and artificial intelligence. 1988, Vol 7, Num 3, pp 277-285, issn 0232-0274Article

Simplifications to A new approach to the covering radius..MATTSON, H. F.Journal of combinatorial theory. Series A. 1991, Vol 57, Num 2, pp 311-315, issn 0097-3165Article

(0, ±1) ideal matricesNOBILI, P; SASSANO, A.Mathematical programming. 1998, Vol 80, Num 3, pp 265-281, issn 0025-5610Article

A quasi-mechanical method for solving the rectangle covering problem : an approach to tackling NP hard problemsHUANG WENQI; WANG GANG-GIANG.CVGIP. Graphical models and image processing. 1994, Vol 56, Num 3, pp 267-271, issn 1049-9652Article

Unknotting operations of polygonal typeAIDA, H.Tokyo journal of mathematics. 1992, Vol 15, Num 1, pp 111-121, issn 0387-3870Article

COMPUTATION OF HIGHLY RAMIFIED COVERINGSVIDUNAS, Raimundas; KITAEV, Alexander V.Mathematics of computation. 2009, Vol 78, Num 268, pp 2371-2395, issn 0025-5718, 25 p.Article

CORE PARTITIONS AND BLOCK COVERINGSOLSSON, JØrn B.Proceedings of the American Mathematical Society. 2009, Vol 137, Num 9, pp 2943-2951, issn 0002-9939, 9 p.Article

All n-cotilting modules are pure-injectiveSOVICEK, Jan.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 7, pp 1891-1897, issn 0002-9939, 7 p.Article

  • Page / 45