New answers tagged ct.category-theory
2
votes
Are there knot theoretic formulations of NP complete problems?
A fairly recent knot theoretic related result to do with NP hardness, or NP completeness are the following results that show finding that a link has a splitting number k is NP-hard. Other link ...
Top 50 recent answers are included
Related Tags
ct.category-theory × 125type-theory × 30
pl.programming-languages × 27
functional-programming × 19
lo.logic × 17
reference-request × 12
monad × 12
lambda-calculus × 11
denotational-semantics × 10
algebra × 9
semantics × 8
domain-theory × 7
haskell × 7
dependent-type × 6
typed-lambda-calculus × 5
parametricity × 5
cc.complexity-theory × 4
linear-logic × 4
soft-question × 3
computability × 3
ds.data-structures × 3
type-systems × 3
db.databases × 3
proof-theory × 3
homotopy-type-theory × 3