How to classify and compare algorithm asymptotic runtimes
By:
David
On:
Fri 11 September 2015
Asymptotic runtimes can be classified to help with comparison and understanding. There are also some tricky examples that can't be classified at first sight, but will require simple mathematical transformations.
What are the types of Proofs methods, Rules of inference, Propositional equivalence
By:
David
On:
Sat 05 September 2015
Confusing terminology aside, this is a summary of the most important stuff needed for doing proof problems in Discrete Mathematics
What are the diffrent ways of saying proposition p → q
Category: Math
Tag:
Discrete Math
By:
David
On:
Sat 29 August 2015
The simple statement p → q in discrete mathematics gets confusing when put into English.
Here is a table of the common ways of saying p → q: