On the Counterfeit Coins Problem | Searching for counterfeit coins by a balance Second Edition

An-Ping Li

ISBN 10: 3639294661 / ISBN 13: 9783639294668

Published by VDM Verlag Dr. Müller, 2010

About this Item

On the Counterfeit Coins Problem | Searching for counterfeit coins by a balance Second Edition | An-Ping Li | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639294668 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Seller Inventory # 107288030

Bibliographic Details

• Title: On the Counterfeit Coins Problem | Searching for counterfeit coins by a balance Second Edition
• Publisher: VDM Verlag Dr. Müller
• Publication Date: 2010
• Language: English
• ISBN 10: 3639294661
• ISBN 13: 9783639294668
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 8W x 150H x 220D millimeters 8 millimeters width by 150 millimeters height by 220 millimeters depth
• Weight: 193 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

The counterfeit coins problem is a well-known and important one in combinatorial search theory. The problem may be simply described as that to spend the least number of weighings by a balance to find all the counterfeit coins in a set of coins. With the fascinating and interesting features, and for which there have been found some important applications to the other branches of sciences, it has been an active research topic. In this book there are included the author's main work on this topic, in the chapters 2, 3 and 4 we have presented our results for its three versions, that is the version of the number of fakes is not known beforehand, the version of multi-sets and the version the number of fakes is known in a range respectively. In the end of the book are four appendices including most of algorithms appeared in chapters 2,3 and 4 respectively.

About the Author

I graduated as a Dr. of mathematics at The Institute of Applied Mathematics,Chinese Academy of Sciences. My research interests include combinatorics and cryptography.