Yes. Mapping from 2^n bitstrings to 3 market positions. | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		argv_empty on June 1, 2018 \| parent \| context \| favorite \| on: Markets are efficient if and only if P = NP (2010) Yes. Mapping from 2^n bitstrings to 3 market positions.

kizer on June 1, 2018 [–]

Thanks.

Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact