#AlgorithmDesign

2025-02-11

Learn how to build a fair & efficient Lottery Number Generator in Python! Go beyond basic random number generation & explore advanced techniques for unique number selection, weighted probabilities, and secure random number generation. LotteryNumberGenerator
tech-champion.com/mathematics/

Von meinem Projekt #ANN_at_work sind die Arbeiten #bias&bias und "Hunt2Make" vom #38c3 art- Team ausgewählt worden (Details im Projektpage-Link im Profil). Ich freue mich total, dabei sei zu dürfen!

Außerdem gebe ich beim Kongress den #stablediffusion -Workshop "KI.VooDoo". Die Zeiten sind noch nicht klar. Meldet Euch gern, wenn ihr Interesse habt. Zeiten gebe ich bekannt, sobald ich sie habe.

#unmask_ai #berlin #veranstaltungen_38c3 #haecksenassembly #mediaartist #algorithmdesign #diffusion_models #step2take

Mohammad HajiaghayiMTHajiaghayi@mathstodon.xyz
2023-11-25

In our effort to put courses online, we continue lectures on Algorithmic Lower Bound Course. Now you can watch

Lesson 4-11: Algorithmic Lower Bounds by Mohammad Hajiaghayi - NP-Completeness and Beyond

(FEEL FREE TO SUBSCRIBE TO YOUTUBE @hajiaghayi FOR FUTURE LESSONS Premiering on WEDNESDAYS)

youtu.be/VZyffnAb1r0 (Lesson 4: 3-Partition Problem & Proving NP-Hardness)

youtu.be/4fCD9_1eQw0 (Lesson 5: Puzzle Problem NP-Hardness & 3-Partition)

youtu.be/FIyEj72-UJQ (Lesson 6: 3-SAT Problem & Proving NP-Hardness)

youtu.be/tbSJzaKx2pA (Lesson 7: Puzzle Problem NP-Hardness via 3-SAT)

youtu.be/voRVebBsh94 (Lesson 8: Fine-grained Subcubic Complexity: Part 1)

youtu.be/gRURSM6QARo (Lesson 9: Fine-grained Subcubic Complexity: Part 2)

youtu.be/qPw82bTAXkc (Lesson 10: Fine-grained Subquadratic Complexity 1)

youtu.be/C6j4avVkI7U (Lesson 11: Fine-grained Subquadratic Complexity 2)

#AlorithmicComplexity,

#3SAT,

#3Partition,

#subquadratic,

#subcubic,

#Finegrained,

#HardnessExploration,

#NP,

#PSPACE,

#NPComplete,

#LogSpace,

#ExponentialComplexity,

#ParallelComputation,

#PvsNP,

#NPSPACE,

#NonDeterministicSpace, hashtag

#SavitchTheorem,

#ComplexityClasses,

#Reductions,

#ImportantProblems,

#CommunicationComplexity, hashtag

#GeometricProblems,

#AlgorithmDesign,

#ComputationalComplexity,

#TheoreticalComputerScience,

#AlgorithmicLowerBounds

For comprehensive handwritten lecture notes on this course, visit the instructor's website:

cs.umd.edu/~hajiagha/
The course textbook "Computational Intractability: A Guide to Algorithmic Lower Bounds" by Demaine, Gasarch, and Hajiaghayi is available for free at:

hardness.mit.edu/

Austin (=> @austin@mstdn.party)austin@mstdn.ca
2023-08-04

@abstractcow Speaking of #AlgorithmDesign (which I’ve taken as a course a year ago, so kinda late to ask), any tricks for proving NP-completeness? It’s quite difficult to find a problem to reduce to...

Thomas Otto (he/him)thomasotto
2023-03-27

Using sensitive data in systems to fight ? Since other factors can still re-create social Inequality without them. To counteract these effects, create systems with transparent factors through well-trained teams.
hbr.org/2023/03/removing-demog

Ryan Williamsrrwilliams
2022-11-05

I've been informed that hashtags are fundamental here, so here goes something

Hi everybody! I'm a professor working in namely and . I'm originally from . Sometimes I play but not well. Not completely off but we shall see. Still figuring out this thang

Client Info

Server: https://mastodon.social
Version: 2025.04
Repository: https://github.com/cyevgeniy/lmst