Skip to content

CSCI3360 · 1

Chapter outline · Randomized complexity

Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.

0 of 4 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.

1.1

Randomized computation and amplification

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

1.2

Zero-error randomized computation

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

1.3

Variance bounds and randomized identity tests

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

1.4

Affine hashing and limited independence

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details