OpenAlex
PricingAboutJobs
Log inGet started
Work

On the parallel complexity of integer programming

HTML

Year: 1989
Type: conference-paper
Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
DOI: 10.1145/72935.72948
Author: X. Deng
Institutions: University of California San Diego, Stanford University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: integer programming, parallel complexity, parallel algorithms, computational complexity

Open Access status: closed
OpenAlex ID: W2001334588
FWCI:
Cites: 20
Cited by: 2
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