Skip to content
Better HN
Top
Best
Ask
Show
New
Jobs
Search
⌘K
0 points
calf
2y ago
0 comments
Save
Share
Is that related to #P complexity at all, the complexity class of counting the number of solutions to an NP-complete instance?
0 comments
2 comments · 1 top-level
top
newest
oldest
tristramb
2y ago
· 1 in thread
No
calf
OP
2y ago
Why not, they sound like similar problems and the latter would motivate computer scientists to learn about sheafs as per the approach taken in OP's book which is applied/example driven.
j
/
k
navigate · click thread line to collapse