Discrete Algorithms

• The theory and techniques of algorithms that deal with Discrete structures are discussed.

• Examples include Logic, Sets, Graphs, and Integers.

  • Discrete structures tend to cause combinatorial explosion.

• Computational time

  • How important speed is.

  • If a calculation takes 100 years, it is impossible for that person to solve it (as their lifespan is finite).

    • (blu3mo) I thought that was an interesting way of thinking.

  • Two patterns of time-consuming calculations:

      - This falls into the field of [[Property Testing]] and other related areas.
    

(blu3mo) I don’t really understand the relationship between the terms “Discrete Structure Processing” and “Discrete Algorithms”.

Examples:

• Maximizing influence problem
• Combinatorial correlation test

(Expert in Computer Science)