Skip to main content

Focus areas

Artificial Intelligence

Quantum Computing

About

Artificial Intelligence

Quantum Computing

Focus areas
Blog
Publications
Careers
About

Publications

Home
Publications

Filter by

1 result for Philip N. Klein

New hardness results for planar graph problems in p and an algorithm for sparsest cut
- - Amir Abboud
  - Vincent Cohen-Addad
  - et al.
- 2020
- STOC 2020

Date

Start

End

Featured collections

Popular topics

Focus areas
Quick links
Work with us
- Careers
- Contact Research
Directories
Follow us

Contact IBM
Privacy
Terms of use
Accessibility