O'Reilly logo

Discrete Structures, Logic, and Computability, 4th Edition by James L. Hein

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

References

Akra, M., and L. Bazzi, On the solution of linear recurrence equations. Computational Optimization and Applications 10 (1998), 195-210.

Appel, K., and W. Haken, Every planar map is four colorable. Bulletin of the American Mathematical Society 82 (1976), 711-712.

Appel, K., and W. Haken, The solution of the four-color-map problem. Scientific American 237 (1977), 108-121.

Apt, K. R., Ten years of Hoare’s logic: A survey—Part 1. ACM Transactions on Programming Languages and Systems 3 (1981), 431-483.

Backus, J., Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communications of the ACM 21 (1978), 613-641.

Bates, G. E., Probability. Addison-Wesley, Reading, MA, 1965.

Bondy, J. A. ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required