Discrete Structures with Contemporary Applications

Regular price €68.99
Regular price €69.99 Sale Sale price €68.99
A01=Alexander Stanoyevitch
Age Group_Uncategorized
Age Group_Uncategorized
Author_Alexander Stanoyevitch
automatic-update
Boolean algebra
Category1=Non-Fiction
Category=PBC
Category=PBV
Category=UY
circuit design
coding theory
combinatorics
COP=United Kingdom
counting techniques
Delivery_Pre-order
discrete mathematics
discrete probability
discrete structures
eq_computing
eq_isMigrated=2
eq_new_release
eq_non-fiction
generating functions
genetic algorithms
graph optimization algorithms
graph theory
Language_English
MATLAB
network flows
number theory
PA=Not yet available
Price_€50 to €100
probabilistic primality tests
PS=Forthcoming
public key cryptography
simulations
softlaunch

Product details

  • ISBN 9781032917368
  • Weight: 453g
  • Dimensions: 178 x 254mm
  • Publication Date: 14 Oct 2024
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
  • Language: English
Delivery/Collection within 10-20 working days

Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock

10-20 Working Days
: On Backorder

Will Deliver When Available
: On Pre-Order or Reprinting

We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!

Reflecting many of the recent advances and trends in this area, Discrete Structures with Contemporary Applications covers the core topics in discrete structures as well as an assortment of novel applications-oriented topics. The applications described include simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory.

A modern and comprehensive introduction to discrete structures
With clear definitions and theorems and carefully explained proofs, this classroom-tested text presents an accessible yet rigorous treatment of the material. Numerous worked-out examples illustrate key points while figures and tables help students grasp the more subtle and difficult concepts. "Exercises for the Reader" are interspersed throughout the text, with complete solutions included in an appendix. In addition to these, each section ends with extensive, carefully crafted exercise sets ranging from routine to nontrivial; answers can be found in another appendix. Most sections also contain computer exercises that guide students through the process of writing their own programs on any computing platform.

Accommodates various levels of computer implementation
Although the book highly encourages the use of computing platforms, it can be used without computers. The author explains algorithms in ordinary English and, when appropriate, in a natural and easy-to-understand pseudo code that can be readily translated into any computer language. A supporting website provides an extensive set of sample programs.

Alexander Stanoyevitch is a professor at California State University–Dominguez Hills. He completed his doctorate in mathematical analysis at the University of Michigan, Ann Arbor, and has held academic positions at the University of Hawaii and the University of Guam. Dr. Stanoyevitch has taught many upper-level classes to mathematics and computer science students, has published several articles in leading mathematical journals, and has been an invited speaker at numerous lectures and conferences in the United States, Europe, and Asia. His research interests include areas of both pure and applied mathematics.