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

C

---

• CAD-Design of VLSI-Circuits
• Canonical
• Canonical Labeling
• canonical pairs
• Canonization
• cap sets
• capacity
• capacity-achieving codes
• cardinality theorem
• Catalytic Computation
• cause
• Caylay graphs
• Cayley graphs
• CC_0[p]
• cdcl
• cell probe
• cell probe model
• cell-probe
• Cell-Probe Model
• cellular and graph automata
• Cellular and Graph Automata
• cellular automata
• center-surround receptive fields
• Central limit theorem
• certificate complexity
• CH
• Chaining argument
• channel capacity
• Channel polarization
• channel routing
• Character Sums
• Characteristic Polynomial
• characteristic set
• characterizations of testability
• Cheap paths LP
• cheat sheets
• cheatable
• Chebychev polynomials
• checking stack automata
• Chernoff
• chernoff bound
• Chernoff Bounds
• Chernoff-Hoeffding bound
• Chevalley-Warning Theorem
• Chien model
• Chinese Remainder Representation
• Chinese Remainder Theorem
• chinese remaindering
• choose
• Chor-Goldreich sources
• chordal graphs
• Chosen Ciphertext Attacks
• chosen message attacks
• chosen-ciphertext security
• Chow parameters
• Chromatic Number
• CHSH Game
• Church-Turing Thesis
• Chvatal cuts
• circuit
• circuit analysis algorithms
• circuit certificate
• circuit complexity
• Circuit Complexity Lower Bounds
• circuit complexity of #P
• circuit depth
• circuit factoring
• circuit lower bound
• circuit lower bounds
• circuit lowerbounds
• Circuit Minimization
• Circuit reconstruction
• Circuit Satisfiability
• Circuit Size
• Circuit size complexity
• circuit testability
• Circuit Value Problem
• circuit value problem CVP
• Circuit-SAT algorithms
• circuits
• Circuits complexity
• circuits on cylinders
• circuits versus formulas
• circulant graph
• circumscription
• Class $AC^o$
• Class field theory
• class separation
• classification
• classification theorem
• classification theory
• clausal form
• Clause learning
• Clause Space
• clean qubit
• Clifford
• clique
• clique covering number
• clique function
• clique partition number
• clique problem
• clique-width
• clone
• clones
• Cloning
• closed timelike curves
• closeness
• Closest Pair
• closest vector
• Closest Vector Problem
• Closure Operator
• closure properties
• closure property
• cloud computing
• CLS
• Clustering
• CNF
• CNF formulas
• CNF Satisfiability
• CNF-SAT
• co-W[i]-completeness
• coarse approximation
• Coarse Differentiation
• Cobham axioms
• cobipartite graphs
• coboundary expanders
• code
• Code Concatenation
• codes
• codeword state
• codeword tests
• coding
• Coding theory
• coin flipping
• coin problem
• Coin Weighing Problem
• coin-flipping
• coin-flipping protocols
• collaborative filtering
• collecive coin-flipping
• collective coin-flipping
• collision problem
• Collision Resistant Hash
• collision resistant hashing
• Collision-Free Hashing
• collision-resistant hash functions
• Collision-Resistant Hashing
• color coding
• Color Refinement
• color-coding
• coloring
• coloring problems
• colorings
• coMA
• combinatorial
• combinatorial algorithms
• Combinatorial Auctions
• combinatorial bounds
• Combinatorial Construction
• Combinatorial Designs
• combinatorial expanders
• Combinatorial Games
• combinatorial geometry
• combinatorial inequalities
• combinatorial lines
• Combinatorial list decoding
• Combinatorial Optimization
• combinatorial optimization problems
• combinatorial problems
• combinatorial properties
• combinatorial reconfiguration
• combinatorial rectangle
• combinatorial rectangles
• Combinatorial search
• Combinatorial Structure
• combinatorical methods
• Combinatorics
• Commitment Scheme
• Commitment Schemes
• Commitments
• common information
• Common Information Learner
• common priors
• Common Randomness
• Common Randomness Generation
• common reference string
• communication
• communication complexity
• communication channels
• Communication complexity
• Communication Complexity, Information Complexity
• communication compression
• communication delay
• communication lower bound
• communication models
• Communication Networks
• Communication Primitives
• communication protocols
• communication with uncertainty
• Communication-space tradeoff
• CommunicationComplexity
• commutative algebra
• Commutative Rank
• commutative ROABP
• commutator
• Compact Graphs
• compact knapsack
• Comparator Circuits
• comparison
• Comparison Algorithms
• comparison based
• comparison based algorithms
• comparison model
• comparison queries
• Compatible operations
• Competing Provers
• competitive analysis
• competitive computation
• Competitive Ratio
• complementation of languages
• complete languages
• complete problems
• complete set
• complete sets
• completeness
• completeness notions
• completeness proofs
• Completion rank
• completness results
• Complex analysis
• complexity
• complexity theoretic reducibility concept for restricted models of computation
• complexity class of functions
• Complexity classes
• complexity classification
• complexity dichotomy
• complexity function
• complexity gap
• Complexity Gaps
• complexity hierachies
• complexity hierarchy
• Complexity Lower bounds
• complexity measure
• Complexity measures
• Complexity of Approximation
• complexity of cryptographic primitives
• complexity of cryptography
• complexity of distributions
• Complexity of equilibria
• complexity of games
• complexity of learning
• complexity of matrix multiplication
• Complexity of Nash equilibria
• complexity of sampling
• Complexity over the Real Numbers
• complexity theoretic operator
• complexity theory
• Complexity-Based Cryptography
• Complexity-theoretic barriers
• ComplexityClasses
• component size
• composed functions
• composite galois fields
• composite moduli
• composite modulus
• composition
• composition theorem
• Composition Theorems
• compressed sensing
• compressibility
• Compression
• compression of Boolean functions
• Compressive sensing
• computa-tional complexity
• computability
• computability theory
• computable analysis
• computable dimension
• computable sequence
• computably random
• computation complexity
• Computation Delegaion
• computation graphs
• computation modulo composite numbers
• computation on time series
• Computation Tree Logic
• Computation Trees
• Computation with noise
• computation with pulses
• computational classes
• Computational Complexity
• computational classes
• Computational Complexity
• computational complexity
• computational algebra
• computational and structural complexity
• computational binding
• computational classes
• Computational Compexity
• Computational Complexity
• computational complexity of enumeration
• Computational Depth
• Computational Difficulty
• Computational Distinguishability
• Computational entropy
• computational finance
• computational game theory
• computational geometry
• computational group
• Computational Indistiguishability
• Computational Indistinguishability
• computational learning
• Computational Learning Theory
• computational lower bounds for experts learning
• Computational Number Theory
• computational power
• Computational Problems in Integer Lattices
• Computational Problems in Lattices
• computational security
• computational social choice
• Computational social choice, winner determination, voting, sampling, prediction, polling
• computational-statistical gap
• computationalcomplexity
• computationally sound interactive proofs of proximity
• computationally-sound proof systems
• Computationally-Sound Proofs (Arguments)
• computationnal complexity
• Computations with Advice
• Computatonal Complexity
• computing on encrypted data
• computional complexity
• Concatenated Codes
• Concatenation of games
• Concentration
• concentration bounds
• Concentration inequality
• concentration of measure
• concept learning
• Concrete Efficiency
• concurrent composition
• concurrent soundness
• concurrent zero knowledge
• concurrent zero-knowledge
• concurrent-read
• condenser
• condensers
• conditional
• conditional complexity
• conditional disclosure of secrets
• conditional disclosure of secrets protocols
• Conditional Entropy Approximation
• Conditional Kolmogorov complexity
• conditional lower bounds
• conditional sampling
• Cone Closed Basis
• configuration space properties
• conflict checkable codes
• conflict decodable codes
• conflict driven clause learning
• CONGEST model
• Congestion Games
• Congestion minimization
• conjunctive normal form
• connectivity
• coNP
• Consistency
• consistency problem
• Consistency test using random walk
• Constant and Sublinear Time
• constant depth
• constant depth circuit
• Constant depth circuits
• constant depth formulas
• constant prover proof systems
• constant randomness
• Constant Round Communication Complexity
• constant space
• Constant Time
• Constant width
• constant-cost communication
• constant-depth
• Constant-depth Boolean circuits
• constant-depth circuit
• constant-depth circuits
• constant-depthcircuits
• constant-round
• constant-round statistically hid-
• constant-time approximation
• constant-weight codes
• constant-width
• Constant-Width Circuits
• Constrained Learning
• Constraint Propagation
• constraint satisfaction
• constraint satisfaction problem
• Constraint satisfaction problems
• constriant satisfaction
• constructible sets
• construction
• constructive dimension
• constructive proofs
• Contact Dimension
• contact scheme
• context-free languages
• contingency tables
• continued fraction expansion
• continuous functions
• continuous learning with errors
• continuous local search
• contraction fixed point
• convergence rate
• Convergence Time
• convex
• convex measure
• convex optimization
• Convex Polyhedra
• Convex programs
• convex sets
• convexity
• conveyor flow shop problem
• Cook Reduction
• Cook-Reckhow program
• cooling schedule
• Cooperative game
• cooperative games
• Copeland-Erdos sequences
• coprimality
• Copyright Protection
• core
• core of balanced games
• corner-free sets
• Correctness
• correctness amplification
• correlated equilibrium
• correlated instances
• correlated sampling
• Correlation
• Correlation Attacks
• correlation bound
• Correlation Bounds
• correlation breakers
• Correlation Decay
• correlation distillation
• Correlation testing
• correlations
• corruption
• corruption bound
• cost allocation
• Cost Register Automata
• counter automata
• counting
• Counting Circuits
• counting classes
• counting complexity
• counting complexity class
• Counting Hierarchy
• counting inversions
• counting logspace classes
• counting problems
• counting quantifiers
• Coupling from the Past
• Courcelle
• cover
• Cover-Free families
• covering codes
• covering number
• Covering numbers
• Covering Problems
• covering radius
• covertext channels
• CREW
• critical clause tree
• Criticality
• Cross-polytope
• crossing sequence
• crown reduction
• CRT Codes
• Cryptanalysis
• cryptographic hard-core predicates
• cryptographic hardness
• cryptographic primitives
• cryptographic proofs
• cryptographic protocols
• cryptography
• cryptography and imperfect randomness
• Cryptography foundations
• cryptography in NC^0
• cryptosystems
• crystalline cohomology
• CSP
• CSP dichotomy conjecture
• CSP refutation
• CSPs
• CTC computation
• Cubic and Subcubic Instances
• Cuckoo Hashing
• cumulative complexity
• Curve Sampler
• Cut Arrays
• Cut Decomposition
• Cut Norm
• cut-free LK
• cutting plane
• cutting plane proofs
• cutting planes
• cutting-plane proof
• CuttingPlanes
• cutwidth
• CVP
• Cycle Covers
• cycle packing
• cycle transversal
• cycles in graphs
• cyclic convolution
• cyclic lattices
• cyclotomic polynomials
• Cyclotomic Scheme

---

ISSN 1433-8092 | Imprint