Information Journal Paper
APA:
CopyTHANG, N.K.. (2010). NP-HARDNESS OF PURE NASH EQUILIBRIUM IN SCHEDULING AND CONNECTION GAMES. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON CURRENT, TRENDS IN THEORY AND PRACTICE OF COMPUTER SCIENCE, -(35), 0-0. SID. https://sid.ir/paper/622877/en
Vancouver:
CopyTHANG N.K.. NP-HARDNESS OF PURE NASH EQUILIBRIUM IN SCHEDULING AND CONNECTION GAMES. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON CURRENT, TRENDS IN THEORY AND PRACTICE OF COMPUTER SCIENCE[Internet]. 2010;-(35):0-0. Available from: https://sid.ir/paper/622877/en
IEEE:
CopyN.K. THANG, “NP-HARDNESS OF PURE NASH EQUILIBRIUM IN SCHEDULING AND CONNECTION GAMES,” PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON CURRENT, TRENDS IN THEORY AND PRACTICE OF COMPUTER SCIENCE, vol. -, no. 35, pp. 0–0, 2010, [Online]. Available: https://sid.ir/paper/622877/en