Basuli Krishnendu (13 results)
Language: English
Published by VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG 2013
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 56.69
£ 3.03 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 72.
A Closer Look Towards Arithmetic Algorithms: With Bks Process
Biswas, Barun; Basuli, Krishnendu; Sen Sarma, Samar; Biswas, Barun; Basuli, Krishnendu; Sen Sarma, Samar
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 81.26
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 64 pages. 8.66x5.91x0.15 inches. In Stock.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 47.31
£ 60.37 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Role of Graph theory in the discipline of computing | Krishnendu Basuli | Taschenbuch | 136 S. | Englisch | 2018 | LAP LAMBERT Academic Publishing | EAN 9786139886104 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter:… preigu.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 87.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: New
£ 152.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG 2013
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 55.75
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 72 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
Language: English
Published by VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG 2013
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 57.40
£ 8.58 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 72.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 30.43
£ 42.25 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sensarma DebajitThe author has received his B.Sc. degree in Computer Science with top rank in the collage and M.Sc. degree in computer Science with top rank in the university. He also obtained his M.Tec…h. degree in Computer Science a.
Language: English
Published by LAP LAMBERT Academic Publishing Jul 2018 2018
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 54.99
£ 19.84 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A graph is a useful medium for modeling of relevant parts of reality in computer science. In real life, the problem may be infinite dimensions, Design of ingenious information structure for minimizing complexity and redundancy of th…e problem space are versatile. Given an arbitrary 'n' node graph the problem may be infinite and in some cases it is uncountable infinite. we are limited to finite. And the problem are represented and manipulated in digital computer are also treated in the same token. The question was coding of graphs to represent in a convenient and useful way to the computer. Coding hare like graphic Integer Sequence. It is our try to show that graph theory can be viewed as a unified theory of all combinatorial structure. Any problem which is combinatorial in nature can be solved in terms of graphical structure. A good algorithm for any combinatorial problems can have costly payoff has lead to terrific advances in the state of the art. So our approaches are to make or present simple graph algorithms here. Which when stated in complex way become complex. Some problems are intractable due to lack of improvement of data structure as major criteria. 136 pp. Englisch.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 37.02
£ 42.25 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Biswas BarunThe author completed his graduation in Computer Science (H) first class first, took his M.Sc from West Bengal State university. He is presently working as a PLP in ISI Kolkata. His research…areas are algorithms, graph th.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 45.00
£ 42.25 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Basuli KrishnenduDr. Krishnendu Basuli, Assistant Professor in the Department of Computer Science, West Bengal State University. He qualified UGC-NET with JRF in june 2005. He was associated with Surend…ranath Evening Collage. He pub.
Language: English
Published by LAP LAMBERT Academic Publishing Jul 2018 2018
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 54.99
£ 51.75 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -A graph is a useful medium for modeling of relevant parts of reality in computer science. In real life, the problem may be infinite dimensions, Design of ingenious information structure for minimizing complexity and redundancy of the pr…oblem space are versatile. Given an arbitrary 'n' node graph the problem may be infinite and in some cases it is uncountable infinite. we are limited to finite. And the problem are represented and manipulated in digital computer are also treated in the same token. The question was coding of graphs to represent in a convenient and useful way to the computer. Coding hare like graphic Integer Sequence. It is our try to show that graph theory can be viewed as a unified theory of all combinatorial structure. Any problem which is combinatorial in nature can be solved in terms of graphical structure. A good algorithm for any combinatorial problems can have costly payoff has lead to terrific advances in the state of the art. So our approaches are to make or present simple graph algorithms here. Which when stated in complex way become complex. Some problems are intractable due to lack of improvement of data structure as major criteria.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 136 pp. Englisch.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 55.65
£ 52.71 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A graph is a useful medium for modeling of relevant parts of reality in computer science. In real life, the problem may be infinite dimensions, Design of ingenious information structure for minimizing complexity and redundancy of the pro…blem space are versatile. Given an arbitrary 'n' node graph the problem may be infinite and in some cases it is uncountable infinite. we are limited to finite. And the problem are represented and manipulated in digital computer are also treated in the same token. The question was coding of graphs to represent in a convenient and useful way to the computer. Coding hare like graphic Integer Sequence. It is our try to show that graph theory can be viewed as a unified theory of all combinatorial structure. Any problem which is combinatorial in nature can be solved in terms of graphical structure. A good algorithm for any combinatorial problems can have costly payoff has lead to terrific advances in the state of the art. So our approaches are to make or present simple graph algorithms here. Which when stated in complex way become complex. Some problems are intractable due to lack of improvement of data structure as major criteria.
