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
S
S
- s-t connectivity
- s-t-connectivity
- samplable distribution
- Samplable distributions
- Sample Complexity
- Sampler
- samplers
- Sampling
- sampling algorithm
- sampling problems
- sampling procedures
- sampling protocols
- SAT
- SAT algorithms
- SAT decision
- SAT problem
- SAT solvers
- SAT solving
- satifiability test
- satisfiability
- satisfiability algorithms
- satisfiability problems
- Sauer's Lemma
- Sauer-Shelah lemma
- saving randomness
- Savitch’s theorem
- SC
- Scarf's lemma
- Scheduling
- Schemes
- Schnorr random
- Schur concavity
- Schwartz-Zippel
- search problems
- search tree algorithms
- search-to-decision reductions
- search-tree analysis
- Searching
- second moment method
- second-order Horn
- Secret Sharing Schemes for Visual Cryptography
- secret-sharing
- secure bit
- Secure computation
- secure multi-party computation
- secure multiparty computation
- secure one-way permutations
- security analysis of protocols
- Seed Obtainers
- Seeded Extractors
- selection
- Selection Problems
- Selection Algorithms
- self correction
- Self Correctors
- self-assembly
- self-correctable codes
- Self-Correction
- self-reducibility
- self-testing
- self-testing programs
- Selfreducibility
- Semantic
- Semantic Classes
- Semantic communication
- semantic measures
- Semantic Models
- Semantic Security
- semi-decision algorithms
- Semi-unbounded fan-in circuits
- Semidefinite programming
- Semidefinite Programs
- Semidefinite Relaxation
- semirecursive
- Sensitivity
- sensory processing
- Separable pairs
- Separating hash functions
- separation
- separation of reducibilities
- Separator
- sequent calculus
- Sequential and Synchronous Dynamical Systems
- series-parallel
- server-aided secret computation
- set cover
- Set Disjointness
- Set disjointness problem
- Set multicover
- set packing
- set splitting
- Set Systems
- Set theory
- Shamir message passing scheme
- Shannon capacity
- Shannon entropy
- sharpSAT
- Sherali-Adams
- Sherali-Adams relaxations
- shift commutator
- short advice
- shortest path
- Shortest Path Tree
- Shortest Paths
- Shortest Superstring
- shortest vector
- shortest vector problem
- shrinkage exponent
- shuffle
- Sidechannel attacks
- Sierpinski triangle
- Sierpinski triangles
- Sieving algorithms
- sigmoidal gates
- Sigmoidal Networks
- sigmoidal neural networks
- sign degree
- Sign-rank
- signature
- Signature Coding Problem
- signed formulas
- signed permutations
- simple set
- simplex
- simulated annealing
- simulation
- simulation order
- simulations
- simultaneous message model
- Simultaneous Protocols
- simultaneous security
- simultaneous security of bits
- single orbit
- Singular Value Decomposition
- Singular Value Method
- SINR
- size
- sketching
- skew circuits
- SL
- Sleeping Experts
- Slow growing function
- small bias
- small bias probability spaces
- Small Bias Sample Spaces
- Small bias spaces
- small complexity classes
- Small depth modular andthreshold circuits
- small occurrence instances
- small representation
- Small sample spaces
- Small Set Expansion
- Small Step Improvements
- small-bias generator
- small-bias sample spaces
- small-bias spaces
- Smart Cards
- smart reductions
- Smooth Label cover
- smooth rectangle bound
- Smoothed Analysis
- soap bubbles
- soft-decision decoding
- software protection
- software watermarking
- Solovay-Kitaev
- Solution-list algorithms
- solvable groups
- solvency
- Solving Subset Sum Problems
- sorting
- Sorting algorithms
- Sorting by Reversals
- Sorting by Reversals
- soundness
- Space
- Space Bounded Randomized Computation
- space complexity
- Space Hierarchy
- Space Optimal Algorithm
- space-bounded computation
- space-bounded reduction
- span program
- Span Programs
- Spanners
- spanning cacti
- spanning subgraphas
- spannner
- sparse
- sparse graphs
- Sparse Instances
- sparse languages
- sparse linear systems
- Sparse Networks
- Sparse polynomials
- sparse recovery
- Sparse sets
- Sparseness
- Sparsest cut
- sparsification
- sparsity
- spectral gap
- spectral graph theory
- spectral norms
- Spectral Partitioning
- spectral projection
- spectral techniques
- Speedability
- Speedup
- Sperner's lemma
- sphere coverings
- spherical harmonics
- Spiking Networks
- spiking neurons
- SPL
- split cut
- SQ Learning
- SQ-DIM
- Square-Free Numbers
- Square-free testing
- SSS
- st-connectivity
- stability
- Stability of approximation
- stability of functional equations
- stable functions
- Stackelberg
- Stackelberg games
- Stackelberg Network Pricing Game
- star-free regular languages
- Static Broadcast
- stationary and ergodic source
- Statistical commitments
- statistical difference
- Statistical Indistinguishability
- statistical query
- Statistical Security
- statistical zero knowledge
- statistical zero-knowldge
- Statistical Zero-Knowledge
- Statistical Zero-Knowledge Proofs
- statistically hiding commitments
- statistically-hiding commitment
- Stein
- Steiner point
- Steiner problem
- Steiner Tree
- Steiner Tree Problem
- Steiner Trees
- STOC
- stochastic finite learning
- stopping time
- Straight-Line Programs
- Strategic Game
- Strategic games
- Stream Ciphers
- streaming algorithm
- Streaming Algorithms
- Streaming algorithms, membership testing, context-free languages, finger printing
- Streaming Computation
- strict polynomial-time
- String Compression
- Strip Exchanging, Block Sorting, Optical Character Recognition, Genome Rearrangement
- Strip packing problem
- Strong and Weak Representations
- strong direct product theorems
- Strong Expanders
- strong nondeterministic reductions
- strong reducibilities
- Strongly Polynomial Time
- structural complexity
- structure homomorphism
- structured matrices
- sub-linear
- sub-polynomial algorithm
- Subdense Instances
- Subdistribution bounds
- Subexponential Complexity
- Subgroup Distance problem
- Subgroup membership problem
- sublinear algorithms
- Sublinear approximation
- Sublinear ratio
- sublinear separators
- Sublinear time
- Sublinear time algorithms
- Sublinear-time
- Sublinear-time algorithms
- sublogarithmic complexity bounds
- Sublogarithmic Space Classes
- submodularity
- subsequence
- Subset Sum
- Subspace approximation
- Subspace-evasive sets
- Successive Minima
- succinct circuits
- succinct data structure
- Succinct Description
- succinct PCPs
- succinct problems
- succinct representations
- succint graph representation
- Sum Check Protocol
- Sum of square roots
- Sum of square roots problem
- sum product estimate
- sum-check
- Sum-Sets
- summation by octaves
- Sums of powers of linear forms
- Sunflowers
- superconcentrator
- Superconcentrators
- supermodels
- superposition problem
- superterse
- supervised learning
- supportive
- survey
- SVP
- Switching
- switching lemma
- switching networks
- sylvester gallai
- Sylvester graph
- Sylvester--Gallai Theorem
- Sylvester-Gallai
- symbol system
- Symbolic algorithms
- symbolic-matrix
- Symmetric alternation
- Symmetric Computation
- Symmetric function
- Symmetric function, Fourier Spectrum, Learning Juntas
- symmetric functions
- symmetric gate
- Symmetric Instances
- symmetric log-space
- Symmetric Logarithmic Space
- Symmetric Logspace
- symmetric polynomials
- Symmetric Polynomials mod 6
- symmetric Turing machines
- symmetries
- symmetry
- symmetry of information
- synchronous networks
- Syntactic (1
- Syntactic Hierarchy
- syntactic multilinearity
- systems of differential equations
- S_2 ZPP
- S_2^p