Digital Commons @ IWU
metadata only
Fall 2015 CS 136 Sect. 1 Computational Discrete Mathematics
Additional concepts in discrete mathematics. Recurrence relations, counting, and combinatorics. Discrete probability. Algorithmic graph theory. Programming with advanced data structures. Prerequisite: None. Offered each fall. Cross-listed w/MATH 136
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fall 2016 CS 136 Sect. 1 Computational Discrete Mathematics#1398527
- Spring 2015 CS 135 Sect. 1 Applications of Sets, Logic, and Recursion#1398509
- Introduction to Mathematical Programming#3612
- 1000 Mathematical Logic and Reasoning Problems Volume 1: The First 570 Exercises in Logic, Sets, and Arithmetic for Developing Mathematical Thinking#1055923
- Objections to Computationalism: A Survey#753622
Record · ID 1398510
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive