ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
4
views
0
references
Top references
cited by
74
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,670
similar
All similar
Record
: found
Abstract
: not found
Conference Proceedings
: not found
A new polynomial-time algorithm for linear programming
proceedings-article
Author(s):
N. Karmarkar
Publication date
(Print):
1984
Conference name:
the sixteenth annual ACM symposium (STOC '84)
Conference date:
-
Read this article at
ScienceOpen
Publisher
Further versions
open (via free pdf)
Powered by
Review
Review article
Invite someone to review
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Author and article information
Conference
Publication date (Print):
1984
Pages
: 302-311
Article
DOI:
10.1145/800057.808695
SO-VID:
6ab10806-1ea2-4c12-874d-d1da5e8f405a
Copyright ©
© 1984
Conference name:
the sixteenth annual ACM symposium
Conference acronym:
STOC '84
Conference location:
Not Known
Conference date:
-
Conference sponsor:
SIGACT, ACM Special Interest Group on Algorithms and Computation Theory
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
3,670
Galois groups in a family of dynatomic polynomials
Authors:
David Krumm
A Comparison between Adomian’s Polynomials and He’s Polynomials for Nonlinear Functional Equations
Authors:
Hossein Jafari
,
Saber Ghasempoor
,
Chaudry Khalique
A General Method for Error Description of CMMs Using Polynomial Fitting Procedures
Authors:
P.H.J. Schellekens
,
A.C.H. van der Wolf
,
J.W.M.C. Teeuwsen
…
See all similar
Cited by
73
A polynomial-time algorithm, based on Newton's method, for linear programming
Authors:
James Renegar
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
Authors:
Walter Murray
,
Philip E. Gill
,
Margaret Wright
…
Cost Efficient Resource Management in Fog Computing Supported Medical Cyber-Physical System
Authors:
Ahmed Barnawi
,
Yong Bing Xiang
,
Lin Gu
…
See all cited by