# Multitasking Capacity: Hardness Results and Improved Constructions

Alexander Yu

SIAM Journal on Discrete Mathematics, pp. 885-903, 2020.

Cited by: 0|Views88

Abstract:

We consider the problem of determining the maximal $\alpha \in (0,1]$ such that every matching $M$ of size $k$ (or at most $k$) in a bipartite graph $G$ contains an induced matching of size at least $\alpha |M|$. This measure was recently introduced in Alon et al. (NIPS 2018) and is motivated by connectionist models of cognition as well...More

Code:

Data:

Get fulltext within 24h
Bibtex

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

for 5 coins

Wechat's Red Packet
?

for 250 coins

Wechat's Red Packet
?

for 1000 coins

Wechat's Red Packet
?

for 2500 coins

Wechat's Red Packet
?