REPORTS > KEYWORDS:
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
R
R
- Rademacher Series
- radial basis functions
- radio networks
- RAM
- RAMs
- ramsey
- Ramsey game
- Ramsey Graph
- Ramsey Graphs
- Ramsey Number
- Ramsey Theorem
- Ramsey theory
- Random
- random 3-SAT
- random 3SAT
- random access coding
- Random Access Machine
- random access machines
- random algorithms
- random beacon
- Random CNF
- Random Codes
- random graph
- Random graph lifts
- random graphs
- Random Hyperplanes
- Random Instances
- Random k-SAT
- random linear code
- random linear codes
- random oracle
- Random oracle model
- random oracles
- random ordering of variables
- Random polynomials
- Random projection
- Random Restriction
- random restrictions
- Random Sampling
- random satisfiability
- Random Self Reducibility
- Random Self Reductions
- random self-reducibility
- random sets
- Random Subarrays
- Random Subprograms
- random variables
- Random walk
- Random Walks
- random walks on graphs
- Random walks on regular graphs
- randomised algorithms
- randomised search heuristics
- Randomization
- Randomized
- Randomized Algebraic Decision Trees
- Randomized Algorithms
- randomized approximation algorithms
- Randomized Branching Programs
- randomized complexity classes
- Randomized Computation
- randomized decision tree complexity
- randomized encodings
- randomized heuristics
- randomized iterate
- randomized logspace
- Randomized Lower Bounds
- Randomized Machine
- Randomized Machines
- Randomized One-Way Communication Complexity
- Randomized Parallel Algorithms
- randomized query complexity
- Randomized reduction
- Randomized reductions
- randomized rounding
- randomized search heuristics
- randomized space bounded algorithms
- Randomized Winnowing
- randomizedalgorithm
- Randomness
- Randomness Complexity
- Randomness Extraction
- Randomness Extractors
- Randomness--Efficient Error Reduction (Amplification)
- Randomness-hardness tradeoffs
- Rank
- Rank aggregation
- rank metric codes
- rank of a matrix
- Rapid mixing
- rational approximation
- rational series
- ray-tracing
- Razborov
- reachability
- read--once parity branching programs
- Read-k Branching Programs
- read-k times networks
- Read-k-times branching programs
- read-once projections
- read-once branching program
- read-once branching programs
- read-once formulae
- read-once formulas
- real circuits
- real functions
- real polynomials on the Boolean hypercube
- Real-time Simulations
- Recognizing Graph Properties
- Reconstructing Graphs from Queries
- reconstruction
- rectangle covering
- rectangle packing with rotations
- rectangular complexity
- rectifiable computable curve
- rectifiable curve
- Rectilinear Plane
- Rectilinear Steiner Tree Problem
- recursion theory
- Recursive algorithm
- Recursive presentability
- reduced form auction
- Reducibilities
- Reducibility
- reducibility among approximation problems
- reduction
- Reductions
- Reed Muller codes
- Reed-Muller
- Reed-Muller code
- Reed-Muller codes
- Reed-Solomon code
- Reed-Solomon codes
- Refereed Games
- regret
- regret minimization
- Regular Amplifiers
- Regular Graphs
- regular hypergraphs
- regular languages
- regular one-way functions
- regular resolution
- regular-graphcodes
- Regularity Lemma
- Related Machines
- relation problems
- relative entropy
- relativization
- relativized resolution
- relativizing
- relaxation
- relaxed decision procedures
- relevant feature learning
- relevant feature minimization
- Reliability
- Remote point problem
- Repeated Games
- repeated sampling
- representation of Boolean functions
- representation theory
- Representations of Boolean functions by polynomials
- representations of the symmetric group
- representing
- Res(2)
- rescaling
- reset attacks
- resettable zero-knowledge
- resilience threshold
- Resolution
- Resolution Width
- resource augmentation
- resource bounded dimension
- resource bounded measure
- resource-bounded Baire category
- Resource-bounded dimension
- resource-bounded genericity
- Resource-bounded Kolmogorov complexity
- Resource-bounded measure
- resource-bounded random sets
- Restricted Integer Programming
- restricted modular intersections, locally decodable codes
- restriction
- revealed preference
- revealed preference, network formation, microeconomics
- revenue
- Reversal Distance
- Reversible Computation
- reversible computing
- Rice's Theorem
- rigidity
- rings
- RLS
- robust
- Robust locally testable codes
- robust satisfiability
- robustness
- robustness of functional equations
- root extraction
- root finding problem
- root-finding
- roots of polynomials
- rotation schemes
- round
- round complexity
- rounding schemes
- routing
- RSA
- RSA-function
- Run-Length Encoding
- Runtime Analysis
- Ruzsa