L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191--194, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Computing Equilibria in Multi-Player Games - Christos Papadimitriou Tim (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191--194, 1979.
Planning In Hybrid Structured Stochastic - Domains Comenius University (Correct)
No context found.
Leonid Khachiyan. A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR, 244:1093--1096, 1979.
Unknown - (Correct)
No context found.
L. Khachiyan "A polynomial algorithm in linear programming," Sov. Math., Dokl., 20, 1979.
Complexity of (Iterated) Dominance - Vincent Conitzer Forbes (Correct)
No context found.
Leonid Khachiyan. A polynomial algorithm in linear programming. Soviet Math. Doklady, 20:191--194, 1979.
Expressive Negotiation over Donations to Charities - Vincent Conitzer Forbes (2004) (Correct)
No context found.
L. Khachiyan. A polynomial algorithm in linear programming. Soviet Math. Doklady, 20:191--194, 1979.
Expressive Negotiation in Settings with Externalities - Vincent Conitzer And (Correct)
No context found.
Khachiyan, L. 1979. A polynomial algorithm in linear programming. Soviet Math. Doklady 20:191--194.
Self-interested Automated Mechanism Design and Implications .. - Conitzer, Sandholm (2004) (Correct)
No context found.
L. Khachiyan. A polynomial algorithm in linear programming. Soviet Math. Doklady, 20:191--194, 1979.
Ecient Optimal Linear Boosting of A Pair of Classifiers - Victor Boyarshinov Dept (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming (in russian). Doklady Akademii Nauk SSSR, 244:1093--1096, 1979.
Ecient Optimal Linear Boosting of A Pair of Classifiers - Victor Boyarshinov Dept (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming (in russian). Doklady Akademii Nauk SSSR, 244:1093--1096, 1979.
A Simple Polynomial-time Rescaling Algorithm for Solving.. - Dunagan, Vempala (2004) (Correct)
No context found.
L. G. Khachiyan, A polynomial algorithm in linear programming, (in Russian), Doklady Akedamii Nauk SSSR, 244, 1093--1096, 1979.
Postman Problems on Mixed Graphs - Mart (2003) (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR, 244(5):1093--1096, 1979.
Axiomatizations and Conservation Results for Fragments of Bounded.. - Buss (1990) (12 citations) (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Math Doklady, 20:191--194, 1979.
Combining Decision Procedures - Manna, Zarba (2003) (3 citations) (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191-194, 1979.
Complexity Classes - Allender, Loui, Regan (Correct)
No context found.
L. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20(1):191--194, 1979. English translation.
Improved Complexity Results on Solving Real-Number Linear.. - Ye (2002) (Correct)
No context found.
L.G. Khachiyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR 244 (1979) 1093-1086. Translated in Soviet Math. Dokl. 20:191-194.
The Combination Problem in Automated Reasoning - Zarba (2004) (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191--194, 1979.
Computing Equilibria in Multi-Player Games - Papadimitriou, Roughgarden (2004) (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191--194, 1979.
Expressive Negotiation over Donations to Charities - Vincent Conitzer Forbes (2004) (Correct)
No context found.
L. Khachiyan. A polynomial algorithm in linear programming. Soviet Math. Doklady, 20:191--194, 1979.
Discrete versus Analog Computation: Aspects of Studying the Same.. - Meer (1998) (Correct)
No context found.
L.G. Khachiyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk USSR, vol. 244 (1979) 1093--1096; english translation in: Soviet Math. Dokl., vol. 20 (1979) 191--194.
Boundedness Theorems for the Relaxation Method - Amaldi, Hauser (Correct)
No context found.
L.G. Khachiyan. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR, 244:1093-1096, 1979.
A General Lower Bound on the Number - Of Examples Needed (Correct)
No context found.
Khachiyan, L.G., "A polynomial algorithm for linear programming", Doklady Akademiia Nauk SSSR, 244:S, 1979, pp. 191-194.
Self-interested Automated Mechanism Design and Implications .. - Conitzer, Sandholm (2004) (Correct)
No context found.
L. Khachiyan. A polynomial algorithm in linear programming. Soviet Math. Doklady, 20:191--194, 1979.
A New Complexity Result on Solving the Markov Decision Problem - Ye (2003) (Correct)
No context found.
L.G. Khachiyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR 244 (1979) 1093-1086. Translated in Soviet Math. Dokl. 20:191-194.
Unknown - Madhukar Korupolu Placement (Correct)
No context found.
L. G. Khachiyan. A polynomial algorithm for linear programming. Soviet Math. Doklady, 20:191--194, 1979.
Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (62 citations) (Correct)
No context found.
L. Khachiyan, "A polynomial algorithm for linear programming," Soviet Math. Dokl., 244(1979), pp. 1093--1096.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC