A - B - C - D - E - F - G - H - I - J - K - L - M - N - O - P - Q - R - S - T - U - V - W - X - Y - Z

W

---

• W hierarchy
• Walsh transform
• Waring Problem
• waring rank
• weak forcing
• Weak functional pigeonhole principle
• Weak Near Unanimity
• weak one-way functions
• weak OR representation
• Weak pigeonhole principle
• Weak Pseudorandom Functions
• Weak Random Sources
• weak regularity
• weak source
• Weak Sources of Randomness
• weakly exponential worst-case running time
• weakly unbounded error communication complexity
• weakly uniform circuits
• Weakly Verifiable Puzzles
• weft hierarchy
• weight distribution
• Weighted Automata
• weighted counting
• Weighted Exact CNF Satisfiability
• weighted flow time
• weighted graph
• Weighted Graphs
• Weighted Instances
• weighted majority
• weighted majority algorithm
• weighted pseudorandom generator
• Weighted Voting Game
• weights
• weil bound
• Weil's Theorems
• Weisfeiler--Leman Algorithm
• white-box complexity
• width
• width restricted resolution
• Williams
• win-lose game
• winner determination
• winner take all
• winner-take-all
• winning strategy
• wire delay
• wireless
• wireless Local Area Network
• wireless networks
• witness
• Witness Encryption
• Witness Functions
• Witness length
• witness size
• witness-indistinguishability
• Witness-Indistinguishable Proofs
• witnessindistinguishable proof systems
• witnessing
• Witt
• Wong sequences
• word problem
• worst case
• worst case analysis
• worst case complexity
• worst case performance
• Worst case to average case reductions
• worst-case
• worst-case complexity
• worst-case lattice assumptions
• worst-case to average-case reductions
• worst-case upper bounds
• worst-case/average-case connection
• Wronskians

---

ISSN 1433-8092 | Imprint