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

T

---

• t-connectivity
• t-design
• t-designs
• t-wise independence
• t-wise permutations
• tableau
• tail bounds
• Talagrand
• Tamper-resilient Cryptography
• Tamper-resilient storage
• Tanner codes
• Tanner product
• tarski algebra
• Tarski fixed point
• tau-conjecture
• tax
• taxonomy labeling
• TC0
• TC^0
• teaching
• teaching dimension
• Teichmueller
• temporal coding
• Temporal Logic
• tensor
• tensor calculus
• Tensor codes
• tensor decomposition
• Tensor optimization
• tensor product
• tensor product codes
• Tensor product of codes
• Tensor Products
• tensor rank
• tensor testing
• tensor-rank
• tensors
• term
• ternary value
• Testability
• Tester
• Testers
• testing
• testing affine subspaces
• testing distributions
• Testing Graph Properties
• testing ordered
• Testing Primality
• testing quantum states
• Testing Square-Free Numbers
• testing unateness
• TFNP
• the a priori probability
• the BGW protocol
• the coin problem
• The Discrete Logarithm Problem
• the game of Sim
• the hidden number problem
• The measurement problem
• the modular group
• The Polynomial-Time Hierarchy
• The Wire-Tap Channel Problem
• Theorem of Razborov
• Theorem Proving
• Theory of Approximation of Combinatorial Optimization Problems
• Theory of Computation
• theory of computing
• Theory of Derandomization
• theory revision
• third-party computing
• Three Player Game
• threshold
• Threshold Representations
• threshold access structure
• threshold circuit
• Threshold Circuits
• threshold degree
• Threshold Direct Product Theorems
• threshold exponent
• threshold formulae
• threshold function
• Threshold Functions
• threshold gates
• threshold phenomena
• threshold sampling
• Threshold secret sharing
• tight bounds
• tight space bounds
• tile complexity
• Tiling
• Time and Space Complexity
• Time Classes
• time complexity
• time complexity of algorithm
• time hierarchies
• time hierarchy
• time lower bound
• time space tradeoff
• Time Space Tradeoffs
• time travel
• time-bounded Kolmogorov complexity
• time-space bounds
• Time-Space Efficient Algorithms
• time-space lower bounds
• time-space product
• time-space trade-offs
• time-space tradeoff
• time-space tradeoffs
• time/memory tradeoff
• Timing Assumptions
• Toda
• Toda's theorem
• Tolerant Property Testing
• Tolerant testing
• top-Toda languages
• Topological and Geomertical Properties of Clusterable Classes
• topological graph theory
• topological sort
• topology
• torus
• torus polynomials
• total functions
• total learning time
• Total Search Problems
• Total Space
• total variation distance
• total wire length
• totally unimodular polytope
• Tournament Graphs
• Tournaments
• Trace code
• trace distance
• trace of the matrix product
• trade-off
• Trade-offs
• Tradeoff
• training perceptrons
• Traitor Tracing System
• transcendence degree
• transitive functions
• Transitive Reduction
• Transparent proofs
• transversal matroids
• trapdoor commitments
• Trapdoor functions
• Trapdoor Permutations
• traveling salesman
• Traveling Salesman Problem
• Travelling Salesman Problem
• traversal sequences
• tree
• tree code
• tree codes
• tree commitment scheme (Merkle tree)
• tree complexity
• tree decomposition
• tree decompositions
• tree depth
• tree evaluation problem
• Tree Metric
• tree rank
• Tree Traversal
• tree width
• Tree-like Circuit
• tree-like proofs
• tree-like resolution
• tree-partition width
• tree-width
• trees
• Treewidth
• Trevisan's extractor
• Trevisan's function
• trial and error complexity
• triangle
• Triangle Constraints
• Triangle counting
• triangle listing
• triangle-free graphs
• Triangles Counting, Sublinear Approximation Algorithm
• triangulation
• tropical circuits
• tropical proof systems
• tropical semiring
• True complexity
• truly n-variate
• truth table
• truth tables
• truth-table completeness
• truth-table reducibility
• Tseitin Formulas
• Tseitin tautologies
• Tsetin tautologies
• TSP
• TSP Problem
• Tucker Lemma
• Turing completeness
• Turing degree
• Turing machine
• Turing machines
• Turing reduction
• Turing reductions
• Turing-equivalence
• turing-machine
• tutorial
• Tutte Polynomial
• TV distance
• two occurrences per variable
• Two Player Game
• two prover games
• two prover games, parallel repetition, expander graph, projection games
• two queries
• two queries assumption for NP oracle
• Two round protocols
• two source
• two source extractor
• Two-Factors
• two-level logic minimization
• Two-party Protocols
• two-pass streaming
• Two-person game
• Two-prover games
• two-source dispersers
• two-source extractor
• two-source extractors
• Two-way Communication Complexity
• Two-way Communication Game
• two-way finite automata
• Type-2 Computation
• typed monoids
• typically-correct derandomization

---

ISSN 1433-8092 | Imprint