Editing Discrete mathematics (section)

===Theoretical computer science===
{{Main|Theoretical computer science}}
[[File:Sorting quicksort anim.gif|right|thumb|210px|[[Computational complexity theory|Complexity]] studies the time taken by [[algorithm]]s, such as this [[Quicksort|sorting routine]].]]

[[File:SimplexRangeSearching.svg|left|thumb|150px|[[Computational geometry]] applies computer [[algorithm]]s to representations of [[geometry|geometrical]] objects.]]

Theoretical computer science includes areas of discrete mathematics relevant to computing. It draws heavily on [[graph theory]] and [[mathematical logic]]. Included within theoretical computer science is the study of algorithms and data structures. [[Computability]] studies what can be computed in principle, and has close ties to logic, while complexity studies the time, space, and other resources taken by computations. [[Automata theory]] and [[formal language]] theory are closely related to computability. [[Petri net]]s and [[process algebra]]s are used to model computer systems, and methods from discrete mathematics are used in analyzing [[VLSI]] electronic circuits. [[Computational geometry]] applies algorithms to geometrical problems and representations of [[geometry|geometrical]] objects, while [[computer image analysis]] applies them to representations of images. Theoretical computer science also includes the study of various continuous computational topics.