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
C
C
- CAD-Design of VLSI-Circuits
- Canonical Labeling
- canonical pairs
- Canonization
- cardinality theorem
- Cayley graphs
- CC_0[p]
- cell probe
- cell-probe
- Cell-Probe Model
- cellular and graph automata
- Cellular and Graph Automata
- cellular automata
- center-surround receptive fields
- Central limit theorem
- channel capacity
- channel routing
- Character Sums
- Characteristic Polynomial
- characteristic set
- Cheap paths LP
- cheatable
- checking stack automata
- Chernoff
- chernoff bound
- Chernoff-Hoeffding bound
- Chien model
- Chinese Remainder Representation
- Chinese Remainder Theorem
- chinese remaindering
- chordal graphs
- Chosen Ciphertext Attacks
- chosen-ciphertext security
- Chromatic Number
- CHSH Game
- Church-Turing Thesis
- Chvatal cuts
- circuit
- circuit complexity
- Circuit Complexity Lower Bounds
- circuit complexity of #P
- circuit depth
- circuit lower bound
- circuit lower bounds
- circuit lowerbounds
- Circuit Minimization
- Circuit Size
- Circuit size complexity
- Circuit Value Problem
- circuit value problem CVP
- circuits
- Circuits complexity
- circuits on cylinders
- circulant graph
- circumscription
- Class $AC^o$
- Class field theory
- class separation
- classification
- classification theory
- clausal form
- Clause learning
- clique
- clique covering number
- clique function
- clique partition number
- clique problem
- clique-width
- clone
- clones
- Cloning
- closed timelike curves
- closeness
- closest vector
- Closest Vector Problem
- closure properties
- closure property
- cloud computing
- Clustering
- CNF
- CNF formulas
- CNF Satisfiability
- co-W[i]-completeness
- Coarse Differentiation
- Cobham axioms
- cobipartite graphs
- code
- Code Concatenation
- codes
- codeword state
- codeword tests
- coding
- Coding theory
- coin flipping
- Coin Weighing Problem
- coin-flipping
- collecive coin-flipping
- collective coin-flipping
- collision problem
- Collision Resistant Hash
- Collision-Free Hashing
- collision-resistant hash functions
- color coding
- color-coding
- coloring
- coloring problems
- colorings
- coMA
- combinatorial algorithms
- Combinatorial Construction
- Combinatorial Designs
- Combinatorial Games
- combinatorial geometry
- combinatorial inequalities
- Combinatorial list decoding
- Combinatorial Optimization
- combinatorial optimization problems
- combinatorial problems
- combinatorial properties
- combinatorial rectangle
- combinatorial rectangles
- Combinatorial search
- Combinatorial Structure
- Combinatorics
- Commitment Scheme
- Commitment Schemes
- common information
- common priors
- common reference string
- communication
- communication channels
- Communication complexity
- communication delay
- communication models
- Communication Networks
- Communication Primitives
- communication protocols
- Communication-space tradeoff
- CommunicationComplexity
- commutator
- compact knapsack
- comparison
- Comparison Algorithms
- comparison based
- comparison model
- 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
- completness results
- complexity
- complexity theoretic reducibility concept for restricted models of computation
- complexity class of functions
- Complexity classes
- complexity classification
- complexity gap
- complexity hierachies
- complexity hierarchy
- Complexity Lower bounds
- complexity measure
- Complexity of Approximation
- complexity of learning
- complexity of matrix multiplication
- Complexity over the Real Numbers
- complexity theoretic operator
- complexity theory
- ComplexityClasses
- component size
- composed functions
- composite moduli
- composite modulus
- composition
- compressed sensing
- compressibility
- Compression
- computa-tional complexity
- computability
- computability theory
- computable analysis
- computable sequence
- computably random
- computation complexity
- Computation Delegaion
- computation graphs
- computation modulo composite numbers
- computation on time series
- Computation Trees
- computation with pulses
- computational classes
- Computational Complexity
- computational classes
- Computational Complexity
- computational algebra
- computational and structural complexity
- computational binding
- computational classes
- Computational Complexity
- computational complexity of enumeration
- Computational Depth
- Computational Difficulty
- Computational Distinguishability
- computational game theory
- 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
- computationalcomplexity
- computationally-sound proof systems
- computationnal complexity
- Computations with Advice
- Computatonal Complexity
- computing on encrypted data
- computional complexity
- Concatenated Codes
- Concentration
- concentration bounds
- Concentration inequality
- concept learning
- concurrent composition
- concurrent soundness
- concurrent zero knowledge
- concurrent zero-knowledge
- concurrent-read
- condenser
- condensers
- conditional
- conditional complexity
- configuration space properties
- Congestion Games
- Congestion minimization
- conjunctive normal form
- connectivity
- coNP
- Consistency
- consistency problem
- Constant and Sublinear Time
- constant depth
- constant depth circuit
- Constant depth circuits
- constant depth formulas
- constant prover proof systems
- Constant Time
- Constant width
- constant-depth
- constant-depth circuit
- constant-depth circuits
- constant-depthcircuits
- constant-round
- constant-round statistically hid-
- constant-time approximation
- Constant-Width Circuits
- Constraint Propagation
- constraint satisfaction
- constraint satisfaction problem
- Constraint satisfaction problems
- constructible sets
- construction
- constructive dimension
- contact scheme
- context-free languages
- contingency tables
- continued fraction expansion
- continuous functions
- Convergence Time
- convex
- convex measure
- convex optimization
- Convex Polyhedra
- convex sets
- conveyor flow shop problem
- Cook-Reckhow program
- cooling schedule
- Cooperative game
- cooperative games
- Copeland-Erdos sequences
- coprimality
- Copyright Protection
- core
- core of balanced games
- correctness amplification
- Correlation
- Correlation Attacks
- correlation distillation
- Correlation testing
- corruption
- cost allocation
- counting
- Counting Circuits
- counting classes
- counting complexity
- counting complexity class
- Counting Hierarchy
- counting logspace classes
- counting problems
- counting quantifiers
- Courcelle
- Cover-Free families
- covering codes
- covering number
- Covering Problems
- covering radius
- CREW
- critical clause tree
- Cross-polytope
- crown reduction
- CRT Codes
- Cryptanalysis
- cryptographic hard-core predicates
- cryptographic hardness
- cryptographic proofs
- cryptographic protocols
- cryptography
- cryptography and imperfect randomness
- Cryptography foundations
- cryptosystems
- CSP
- CSP dichotomy conjecture
- Cut Arrays
- Cut Decomposition
- Cut Norm
- cutting plane
- cutting planes
- cutting-plane proof
- CuttingPlanes
- CVP
- Cycle Covers
- cyclic convolution
- cyclic lattices
- cyclotomic polynomials