|
gptkb:NP_complexity_class
|
set of decision problems for which a given solution can be verified in polynomial time
|
|
gptkb:core_(game_theory)
|
set of imputations that cannot be improved upon by any coalition
|
|
gptkb:Contravariant_functor
|
Functor F: C → D such that F(f∘g) = F(g)∘F(f)
|
|
gptkb:Image_(mathematics)
|
For function f: X → Y, image is {f(x) | x ∈ X}
|
|
gptkb:S_combinator
|
S x y z = x z (y z)
|
|
gptkb:Bifunctor
|
A functor F: C × D → E, where C, D, E are categories
|
|
gptkb:Kernel_(category_theory)
|
Given a morphism f:X→Y, a kernel is a morphism k:K→X such that f∘k=0 and for any morphism k':K'→X with f∘k'=0, there exists a unique u:K'→K with k∘u=k'.
|
|
gptkb:Pushdown_automaton
|
7-tuple (Q, Σ, Γ, δ, q0, Z0, F)
|
|
gptkb:Nondeterministic_Finite_Automaton
|
5-tuple (Q, Σ, δ, q0, F)
|
|
gptkb:NEXP
|
NEXP = ⋃_{k∈N} NTIME(2^{n^k})
|
|
gptkb:Streett_acceptance_condition
|
A run is accepting if for every pair (E_i, F_i), if E_i is visited infinitely often, then F_i is also visited infinitely often.
|
|
gptkb:little_omega_notation
|
f(n) = ω(g(n)) if for all positive constants c, there exists n0 such that 0 ≤ c·g(n) < f(n) for all n ≥ n0
|
|
gptkb:Deterministic_Finite_Automaton
|
5-tuple (Q, Σ, δ, q0, F)
|
|
gptkb:Big_Theta_notation
|
f(n) = Θ(g(n)) if there exist positive constants c1, c2, n0 such that 0 ≤ c1·g(n) ≤ f(n) ≤ c2·g(n) for all n ≥ n0
|
|
gptkb:NEXPTIME
|
NEXPTIME = ⋃_{k∈N} NTIME(2^{n^k})
|