Python Quiz - Level 9

1. ETH states?

P=NP

3-SAT not sub-exp

NP-complete poly algo

Space=Time

Consensus w/ retries

No consensus async+fault

Async slower than sync

Need N procs

Polynomials

Large integers

Random graphs

Boolean formulas

Sacrifice availability

Always consistent

No C+A+P together

Partition optional

Integer factorization

Discrete log

Shortest Vector Problem

Graph isomorphism

Byzantine tolerance

Single log source

Replace Paxos

Sync clocks

Loop structure

Comp. w/ context

Optimize recursion

Immutable DS

Ω(n)

Ω(n log n)

Ω(n^2)

Ω(log n)

Writers overwrite

Readers snapshot

No logging

Auto optimize