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
T
T
- t-connectivity
- t-design
- t-wise independence
- t-wise permutations
- Talagrand
- Tanner codes
- Tanner product
- tarski algebra
- tau-conjecture
- tax
- taxonomy labeling
- TC0
- TC^0
- temporal coding
- tensor
- tensor calculus
- Tensor codes
- tensor product
- Tensor product of codes
- Tensor Products
- tensor rank
- tensors
- term
- ternary value
- Testability
- testing
- Testing Graph Properties
- Testing Primality
- Testing Square-Free Numbers
- the a priori probability
- the BGW protocol
- The Discrete Logarithm Problem
- the game of Sim
- the hidden number 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
- Three Player Game
- threshold
- Threshold Representations
- threshold circuit
- Threshold Circuits
- Threshold Direct Product Theorems
- threshold function
- Threshold Functions
- threshold gates
- threshold phenomena
- threshold sampling
- tight 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 lower bounds
- time-space product
- time-space tradeoff
- time-space tradeoffs
- Timing Assumptions
- Toda
- Toda's theorem
- top-Toda languages
- Topological and Geomertical Properties of Clusterable Classes
- topological graph theory
- torus
- total learning time
- Total Search Problems
- total wire length
- Tournament Graphs
- Tournaments
- trace distance
- trade-off
- Trade-offs
- Tradeoff
- training perceptrons
- transcendence degree
- Transitive Reduction
- Transparent proofs
- transversal matroids
- trapdoor commitments
- Trapdoor functions
- Trapdoor Permutations
- traveling salesman
- Traveling Salesman Problem
- Travelling Salesman Problem
- traversal sequences
- tree code
- tree codes
- tree complexity
- tree decomposition
- tree depth
- Tree Traversal
- tree width
- Tree-like Circuit
- tree-like proofs
- tree-like resolution
- tree-width
- Treewidth
- Trevisan's extractor
- Trevisan's function
- Triangle Constraints
- triangle listing
- triangle-free graphs
- True complexity
- truth table
- truth tables
- truth-table completeness
- truth-table reducibility
- Tseitin tautologies
- Tsetin tautologies
- TSP
- TSP Problem
- Turing completeness
- Turing degree
- Turing machine
- Turing machines
- Turing reduction
- Turing reductions
- tutorial
- Tutte Polynomial
- two occurrences per variable
- Two Player Game
- two prover games
- two prover games, parallel repetition, expander graph, projection games
- Two-Factors
- two-level logic minimization
- Two-party Protocols
- Two-person game
- two-source extractors
- Two-way Communication Complexity
- Two-way Communication Game
- two-way finite automata
- Type-2 Computation
- typically-correct derandomization