Recent searches

No recent searches

Search options

Only available when logged in.
med-mastodon.com is one of the many independent Mastodon servers you can use to participate in the fediverse.
Medical community on Mastodon

Administered by:

Server stats:

364
active users

med-mastodon.com: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.1

#cook

3 posts2 participants2 posts today
נאריש זשלאָב מענטש

Hey now... maybe it's just possible to leave people the fuck alone?! Yeesh.

"Zachary Neman, a #Jewish #chef of #Iranian descent known for his polished yet accessible #recipes on Instagram, is used to answering questions about #cooking—not #geopolitics. But the escalating conflict between #Israel and #Iran has pulled him into the spotlight, with followers pressuring him to take a public stance on the #war.

Neman, who lives in #NewYork with his family, rose to online fame with his tagline “recipes you'll wanna #cook,” gaining over one million followers thanks to visually refined #MiddleEastern and family-inspired dishes. He often references his Iranian roots and occasionally his Jewish heritage but avoids political commentary."

ynetnews.com/culture/article/h

ynetnews · Iranian Jewish celebrity chef under fire for silence on Israel-Iran warBy Yaniv Pohoryles
☮ ♥ ♬ 🧑‍💻

“Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛)”

‘The #TreeEvaluation #Problem (TreeEval) (Cook et al. 2009) is a central candidate for separating polynomial time (P) from logarithmic space (L) via composition. While space lower bounds of Ω(log2 n) are known for multiple restricted models, it was recently shown by #Cook and #Mertz (2020) that TreeEval can be solved in space O(log2 n/loglogn). Thus its status as a candidate hard problem for L remains a mystery.

Our main result is to improve the space complexity of #TreeEval to O(logn · loglogn), thus greatly strengthening the case that Tree Evaluation is in fact in L. We show two consequences of these results. First, we show that the #KRWconjecture (#Karchmer, #Raz, and #Wigderson 1995) implies L ⊈NC1; this itself would have many implications, such as branching programs not being efficiently simulable by formulas’

<dl.acm.org/doi/10.1145/3618260>

TrendingLive feeds
About