Applied Mathematics

Vol.10 No.9(2019), Paper ID 95305, 10 pages

DOI:10.4236/am.2019.109053

 

The Computational Complexity of Untrapped Choice Procedures

 

Mustapha Balewa Sanni

 

Université Nationale des Sciences, Technologies, Ingénierie et Mathématiques (UNSTIM) d’Abomey, Abomey, Benin
Institut National Supérieur de Technologie Industrielle (INSTI) de Lokossa, Lokossa, Benin

 

Copyright © 2019 Mustapha Balewa Sanni et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

How to Cite this Article

Sanni, M. (2019) The Computational Complexity of Untrapped Choice Procedures. Applied Mathematics, 10, 743-752. doi: 10.4236/am.2019.109053.
Journals Menu
Follow SCIRP
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.