A shorter proof for an explicit formula for discrete logarithms in finite fields.
Zhe-xian WanPublished in: Discret. Math. (2008)
Keyphrases
- finite number
- theorem proving
- complete axiomatization
- linear temporal logic
- discrete geometry
- real numbers
- unit length
- arbitrary size
- computer vision
- translation invariant
- binary valued
- discrete version
- theorem prover
- continuous functions
- computational geometry
- information retrieval
- finite automata
- linear logic
- continuous domains
- real valued functions
- case study
- decision trees