The following pages link to (Q3589189):
Displaying 10 items.
- Computational complexity in the design of voting rules (Q256771) (← links)
- Regularity properties for sparse regression (Q279682) (← links)
- A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions (Q602636) (← links)
- \(\mathcal P = \mathcal{NP}\)? (Q1404168) (← links)
- Quantum one-way permutation over the finite field of two elements (Q1679363) (← links)
- On relationships between complexity classes of Turing machines (Q1682916) (← links)
- NP-completeness in hedonic games (Q1886742) (← links)
- Progress in quantum algorithms (Q2386407) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- Phase retrieval from very few measurements (Q2447980) (← links)
