02640nam 2200565 450 991046500150332120200520144314.01-4438-5967-2(CKB)3710000000105586(EBL)1683200(SSID)ssj0001254799(PQKBManifestationID)11819405(PQKBTitleCode)TC0001254799(PQKBWorkID)11243601(PQKB)10799711(MiAaPQ)EBC1683200(Au-PeEL)EBL1683200(CaPaEBR)ebr10870458(CaONFJC)MIL602426(OCoLC)879026105(EXLCZ)99371000000010558620140523h20142014 uy 0engur|n|---|||||txtccrRecent progress in the Boolean domain /edited by Bernd SteinbachNewcastle upon Tyne, England :Cambridge Scholars Publishing,2014.©20141 online resource (458 p.)"All sections are written from authors who presented their new results at the 10th IWSBP in September 2012 in Freiberg, Germany."1-4438-5638-X Includes bibliographical references and index.Contents; List of Figures; List of Tables; Preface; Foreword; Introduction; Exceptionally ComplexBoolean Problems; 1. Boolean Rectangle Problem; 2. Four-Colored Rectangle-FreeGrids; 3. Theoretical and PracticalConcepts; Digital Circuits; 4. Design; 5. Test; Towards Future Technologies; 6. Reversible and Quantum Circuits; Bibliography; List of Authors; Index of AuthorsIn today's world, people are using more and more digital systems in daily life. Such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the cause of major problems in the process of design and realization of circuits. According to...Automatic theorem provingCongressesLogic, Symbolic and mathematicalCongressesElectronic books.Automatic theorem provingLogic, Symbolic and mathematical004.015113Steinbach BerndMiAaPQMiAaPQMiAaPQBOOK9910465001503321Recent progress in the Boolean domain2241540UNINA