default search action
"Transforming graph states to Bell-pairs is NP-Complete."
Axel Dahlberg, Jonas Helsen, Stephanie Wehner (2019)
- Axel Dahlberg, Jonas Helsen, Stephanie Wehner:
Transforming graph states to Bell-pairs is NP-Complete. CoRR abs/1907.08019 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.