Discrete Mathematics

Authors:
Richard Johnsonbaugh
Affiliations:
-
Venue:
Discrete Mathematics
Year:
2000

Citing 0
Cited 11

On constructing Karnaugh maps

ACM SIGCSE Bulletin
Using an automated reasoning program as a CS application in discrete mathematics

Journal of Computing Sciences in Colleges
Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

Information Sciences: an International Journal
A new approach to mine frequent patterns using item-transformation methods

Information Systems
Choose topics for MACS seminars

Journal of Computing Sciences in Colleges
Computerised dynamic Gantt-chart for maintenance scheduling and management

International Journal of Computer Applications in Technology
Modelling PLC characteristics for resource allocation

International Journal of Computer Applications in Technology
Structural group auditing of a UMLS semantic type's extent

Journal of Biomedical Informatics
Teaching mathematical proofs to CS major students in the class of discrete mathematics

Journal of Computing Sciences in Colleges
Speed and portability issues for random number generation on graphical processing units with CUDA and other processing accelerators

AusPDC '11 Proceedings of the Ninth Australasian Symposium on Parallel and Distributed Computing - Volume 118
Reductions and Saturation Reductions of (Abstract) Knowledge Bases

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.05

Visualization

Abstract

From the Publisher:This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics.