OpenAlex
PricingAboutJobs
Log inGet started
Work

Quantum and classical algorithms for approximate submodular function minimization

HTML

Year: 2019
Type: article
Source: Quantum Information and Computation
DOI: 10.26421/qic19.15-16-5
Authors: Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha
Institutions: Centre National de la Recherche Scientifique, Université Paris Cité, Institut de Recherche en Informatique Fondamentale, Centre for Quantum Technologies, National University of Singapore, UMI MajuLab
Language: English

Topic: Quantum Computing Algorithms and Architecture
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: submodular function minimization, quantum algorithms, classical algorithms, discrete optimization, strongly polynomial algorithms, additive approximation

Open Access status: closed

Funder: Agence Nationale de la Recherche
Awards: Quantum algorithms and applications, Quantum algorithms for massive data
OpenAlex ID: W2998300574
FWCI: 0.804
Cites: 45
Cited by: 16
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security