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

L

---

• L complete
• L vs. BPL
• L vs. RL
• l-mixed
• Label Cover
• Label-Cover
• label-invariant
• Language
• language-dependent commitment schemes
• Laplacian
• large cycles in graphs
• large deviation bounds
• Large generating systems
• Large Sets
• Las Vegas randomization
• Las Vegas
• Las-Vegas Communication Complexity
• Las-Vegas OBDDs
• laser method
• Lasserre
• Lasserre hierarchy
• latin square
• lattice
• Lattice algorithms
• Lattice problems
• Lattice Reduction
• Lattice Reduction Problems
• Lattice, Unique Shortest Vector, Decision vs Search, NP-hardness, Hardness of Approximation
• Lattice-based cryptography
• lattices
• Lattices, Algorithms, Closest Vector Problem, Voronoi cell
• laurent polynomials
• layered grid graph
• layered planar graph
• layout
• layout problems
• LCCs
• LDC Lower Bounds
• LDPC
• LDPC codes
• leader election
• leaf languages
• leaf-languages
• leakage
• leakage resilience
• leakage resilient
• Leakage-Resilience
• learnability
• Learnability, strong concept classes, black-box reductions
• learning
• learning algorithms
• Learning Boolean Functions
• Learning circuits
• learning complexity
• learning decision trees
• learning dimension
• learning from positive samples
• learning halfspaces
• learning heavy Fourier coefficients
• learning mixtures of product distributions
• learning models
• learning of Boolean functions
• Learning over Large Fields
• learning parities with noise
• Learning Parity
• Learning Parity with Noise
• learning speedups
• Learning theory
• learning under irrelevant information
• Learning with Error
• learning with errors
• Leftover Hash Lemma
• Lempel-Ziv Compression
• Lempel-Ziv compressor
• length
• Length of Proofs
• length-increasing reductions
• Leontief economy
• Levin's Economical Work Investment Strategy
• lexicographical self-reduction
• Lie algebra
• Lie algebras
• Lift and Project
• Lifting
• lifting theorems
• lifts
• limitations
• limited ambigiuty
• limited dependence
• Line Embeddings
• line point incidences theorem
• line point test
• linear algebra
• Linear Algebra Method
• Linear algebraic list decoding
• Linear and Semidefinite Programming
• Linear approximation
• Linear Arrangements
• linear autarkies
• linear bounds
• linear branching programs
• Linear Circuits
• linear code
• linear code equivalence
• Linear Codes
• Linear complexity encoding/decoding
• linear decision trees
• Linear Equations
• Linear Equations Over Reals
• linear error-correcting codes
• linear factors
• Linear Forms
• Linear function
• linear functions
• Linear independence
• linear invariance
• Linear Matroid
• Linear Matroids
• linear optics
• Linear Programing
• linear programming
• linear programming duality
• linear programming hierarchies
• linear programmings
• Linear Programs
• linear recurrences
• Linear regression
• Linear relations
• linear sketching
• Linear Spaces
• Linear Subspace
• linear systems
• linear temporal logic
• linear test
• linear threshold element
• linear threshold function
• Linear Threshold Functions
• linear threshold neuron
• Linear threshold predicates
• Linear time
• Linear Time Approximation Schemes
• linear transformation
• Linear Transformations
• linear wires
• Linear-Access Algorithms
• linear-size circuits
• linear-time algorithm
• Linearity test
• linearity testing
• Linearity tests
• linearization
• Linearized Programs
• Linearly representable matroids
• linguistics
• Linial-Nisan Conjecture
• Linked List
• Linnik
• Lipschitz
• Lipschitz constant
• Lipschitz functions
• Lipschitzness
• list constraint satisfaction
• List Decodable Codes
• List decoding
• List Decoding Capacity
• List error-correction
• List Recovery
• List size
• list-approximation of short programs
• list-color
• list-decodable codes
• list-decoding
• Listing
• listing algorithm
• Littlewood-Offord
• LK
• LLL algorithm
• Load Balancing
• local
• Local Algorithms
• Local Central Limit Theorem
• local checkability
• local computation
• local cryptography
• Local Decoding
• Local filter
• local functions
• local Hamiltonians
• Local List Decoding
• local optima
• local PRGs
• local random reductions
• local receptive field neurons
• Local reconstruction
• Local Reconstruction Codes
• local ring
• local satisfiability
• Local Search
• local self-reduction
• local sources
• Local Testability
• local testing
• locality
• Locality Sensitive Hashing
• locally testable codes
• Locally characterizable sets
• Locally Correctable Code
• Locally correctable codes
• Locally correctible codes
• locally decodable code
• Locally decodable codes
• Locally recoverable code
• Locally repairable codes
• locally testable
• locally testable code
• Locally testable codes
• locally-testable
• log approximate rank
• Log Approximate Rank Conjecture
• log depth circuits
• log product
• log rank conjecture
• Log Rank Lower Bound
• log-concave
• Log-rank conjecture
• Log-Space
• log-variate
• logarithmic form
• logarithmic space
• Logarithmic time
• logarithmic-space reducibility
• LogCFL
• logconcave
• LogDCFL
• LogFew
• logic
• logic and complexity
• Logic for Complexity Class
• Logic for PTIME
• logic in computer science
• logical omniscience
• logical uncertainty
• Logspace
• logspace completeness
• Logspace computations
• Logspace counting classes
• logspace decision algorithms
• logspace encodable/decodable codes
• logspace manyone reductions
• logspace reducibility
• logspace reductions
• long code
• long cycles in graphs
• long paths
• Long paths and cycles
• long-distance resolution
• Long-Path
• longest common subsequence
• longest increasing subsequence
• Longest Path
• Lopsided Local Lemma
• Lossless Expander
• lossless expanders
• Lossy Trapdoor Functions
• Lovász Local Lemma
• Lovasz number
• Lovasz theta function
• Lovasz-Schrijver
• Lovasz-Schrijver hierarchy
• Lovasz-Schrijver lift-and-project
• Lovasz-Schrijver proofs
• Lov\'asz theta-function
• low characteristic
• Low Cone Concentration
• low degree
• Low Degree Graphs
• low degree long code
• low degree polynomials
• Low degree test
• Low degree testing
• Low distortion embedding
• Low Level Complexity
• Low Rank
• Low rank approximation
• low rank recovery
• Low sets
• low soundness error
• low-degree curve
• low-degree polynomials
• low-degree test
• low-degree testing
• Low-Degree Tests
• Low-density Parity Check codes
• Low-depth Circuits
• low-distortion embeddings
• Low-rank approximation
• low-rank matrix approximation
• low-support rank concentration
• lower
• lower bounds
• lower bonds
• lower bound
• lower bound for circuit size
• lower bound for multiples
• Lower Bound Method
• lower bound on extension complexity
• lower bound techniques
• lower bounds
• Lower Bounds Algebraic Decision Trees
• lower bounds in non-uniform complexity
• lower bounds on descriptional complexity
• lowerbounds
• lowest common ancestor
• lowness
• LP hierarchies
• LP Relaxation
• LSH
• LTC
• LTCs
• lutz's measure
• LWE

---

ISSN 1433-8092 | Imprint