Discrete Mathematics and its applications

By A. Oxley. 2000

1,408 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/142dad2d2e8e5060eb9561b7744cbc5b4bb90990

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks (2006, methodology): “The intuition behind this metric is to use the least interfered channel as the default channel in the mesh.”
Sociological Realms of Emotional Experience1 (2004, methodology): “We develop this idea by applying shortest-path analyses (Rosen 1988, pp. 401–10) to the correlations among factors.”
View-Invariant Representation and Recognition of Actions (2002, methodology): “We use Warshall’s algorithm to group similar actions (Rosen, 1999).”
Mate choice rules in animals (2006, background): “If there is a cycle of length k somewhere in the matrix, then a 1 will appear along the diagonal when this matrix is raised to the kth power (Rosen 1999, page 472).”
Conjugate Points in Formation Constrained Optimal Multi-Agent Coordination: A Case Study (2007, methodology): “Based on this partial order relation, F can be rendered graphically as a Hasse diagram [14].”
A Proof Assistant for Higher-Order Logic (2002, methodology): “However, we do assume that you are used to logical and set theoretic notation, as covered in a good discrete mathematics course [36], and that you are familiar with the basic concepts of functional programming [5, 16, 31, 37].”
Aegis: A Single-Chip Secure Processor (2007, background): “A multiset is an unordered group of elements where an element can occur as a member more than once [113].”
Torsion of rational elliptic curves over cubic fields and sporadic points on $X_1(n)$ (2012, background): “, gave a complete list of possible torsion structures over quadratic fields: (2) Z/mZ, 1 ≤ m ≤ 18, m 6= 17, Z/2Z⊕ Z/2mZ, 1 ≤ m ≤ 6, Z/3Z ⊕ Z/3mZ, m = 1, 2, Z/4Z⊕ Z/4Z.”
Isabelle/HOL (2002, methodology): “However, we do assume that you are used to logical and set theoretic notation, as covered in a good discrete mathematics course [31], and that you are familiar with the basic concepts of functional programming [5, 13, 27, 32].”