Academic literature on the topic 'P versus NP problem'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'P versus NP problem.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "P versus NP problem"
CALUDE, CRISTIAN S., ELENA CALUDE, and MELISSA S. QUEEN. "INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM." Parallel Processing Letters 23, no. 01 (2013): 1350007. http://dx.doi.org/10.1142/s0129626413500072.
Full textRuiz-Vanoye, Jorge A., Ocotlán Díaz-Parra, Francisco Rafael Trejo-Macotela, and Julio Cesar Ramos-Fernández. "Editorial: P versus NP problem from Formal Languages Theory View." International Journal of Combinatorial Optimization Problems and Informatics 12, no. 1 (2020): 1–8. https://doi.org/10.61467/2007.1558.2021.v12i1.207.
Full textFortnow, Lance. "The status of the P versus NP problem." Communications of the ACM 52, no. 9 (2009): 78–86. http://dx.doi.org/10.1145/1562164.1562186.
Full textMeester, R. W. J., and K. Slooten. "DNA database matches: A p versus np problem." Forensic Science International: Genetics 46 (May 2020): 102229. http://dx.doi.org/10.1016/j.fsigen.2019.102229.
Full textPérez-Jiménez, Mario J. "The P versus NP Problem from the Membrane Computing View." European Review 22, no. 1 (2014): 18–33. http://dx.doi.org/10.1017/s1062798713000598.
Full textKumar, Neelam Jeevan. "Algorithm for P versus NP Problem on Sets by JEEVAN – KUSHALAIAH Method." International Journal of Computer Applications Technology and Research 2, no. 5 (2013): 526–29. http://dx.doi.org/10.7753/ijcatr0205.1005.
Full textOrellana-Martín, David, Luis Valencia-Cabrera, Bosheng Song, Linqiang Pan, and Mario J. Pérez-Jiménez. "Tuning Frontiers of Efficiency in Tissue P Systems with Evolutional Communication Rules." Complexity 2021 (April 28, 2021): 1–14. http://dx.doi.org/10.1155/2021/7120840.
Full textBirget, J. C. "Polynomial-time right-ideal morphisms and congruences." International Journal of Algebra and Computation 28, no. 05 (2018): 791–835. http://dx.doi.org/10.1142/s0218196718500364.
Full textHitchcock, John M., Adewale Sekoni, and Hadi Shafei. "Polynomial-Time Random Oracles and Separating Complexity Classes." ACM Transactions on Computation Theory 13, no. 1 (2021): 11–16. http://dx.doi.org/10.1145/3434389.
Full textde Figueiredo, Celina M. H. "The P versus NP–complete dichotomy of some challenging problems in graph theory." Discrete Applied Mathematics 160, no. 18 (2012): 2681–93. http://dx.doi.org/10.1016/j.dam.2010.12.014.
Full textDissertations / Theses on the topic "P versus NP problem"
Eyono, Obono Séraphin Désiré. "Recherche efficace d'images morphiques de mots." Rouen, 1995. http://www.theses.fr/1995ROUE5014.
Full textKopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.
Full textŠevčíková, Renáta. "NP vyhledávací problémy a redukce mezi nimi." Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-305877.
Full textBooks on the topic "P versus NP problem"
Book chapters on the topic "P versus NP problem"
Calude, Cristian S., Elena Calude, and Melissa S. Queen. "Inductive Complexity of P versus NP Problem." In Unconventional Computation and Natural Computation. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32894-7_2.
Full textFortnow, Lance. "A Personal View of the P versus NP Problem." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39053-1_17.
Full textPérez-Jiménez, Mario J., Alvaro Romero-Jiménez, and Fernando Sancho-Caparrini. "The P Versus NP Problem Through Cellular Computing with Membranes." In Aspects of Molecular Computing. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24635-0_26.
Full textKrantz, Steven G., and Harold R. Parks. "The P/NP Problem." In A Mathematical Odyssey. Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-8939-9_10.
Full textBürgisser, Peter, Michael Clausen, and Mohammad Amin Shokrollahi. "P Versus NP: A Nonuniform Algebraic Analogue." In Grundlehren der mathematischen Wissenschaften. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-662-03338-8_21.
Full textBlum, Lenore, Felipe Cucker, Michael Shub, and Steve Smale. "Algebraic Settings for the Problem “P ≠ NP?”." In Complexity and Real Computation. Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-0701-6_7.
Full textGrötschel, Martin. "Das Problem mit der Komplexität: P = NP?" In Diskrete Mathematik erleben. Springer Fachmedien Wiesbaden, 2015. http://dx.doi.org/10.1007/978-3-658-06993-3_9.
Full textFan, Xueshuang, Yunjuan Li, and Zongqi Sun. "Theoretical Basis of P and NP Problem." In Lecture Notes in Electrical Engineering. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-0115-6_248.
Full textJukna, S., A. Razborov, P. Savický, and I. Wegener. "On P versus NP∩co-NP for decision trees and read-once branching programs." In Mathematical Foundations of Computer Science 1997. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0029975.
Full textBürgisser, Peter. "On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity." In Mathematical Foundations of Computer Science 2001. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44683-4_2.
Full textConference papers on the topic "P versus NP problem"
Figueira, Diego, S. Krishna, Om Swostik Mishra, and Anantha Padmanabha. "Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/34.
Full textFakotakis, Nikos Dimitris. "P versus NP." In Emerging Tech Conference Edge Intelligence 2022. Hellenic Emerging Technology Industry Association, 2025. https://doi.org/10.63438/ccyx6126.
Full textSrinivasan, N. "Tutorial: Current state of P vs NP problem." In 2011 International Conference on Recent Trends in Information Technology (ICRTIT). IEEE, 2011. http://dx.doi.org/10.1109/icrtit.2011.5972506.
Full textSipser, Michael. "The history and status of the P versus NP question." In the twenty-fourth annual ACM symposium. ACM Press, 1992. http://dx.doi.org/10.1145/129712.129771.
Full textRubin, Stuart H., Thouraya Bouabana-Tebibel, Yasmin Hoadjli, and Zahira Ghalem. "Reusing the NP-Hard Traveling-Salesman Problem to Demonstrate That P~NP (Invited Paper)." In 2016 IEEE 17th International Conference on Information Reuse and Integration (IRI). IEEE, 2016. http://dx.doi.org/10.1109/iri.2016.84.
Full textRybalov, Alexander N. "On the P vs NP problem over reals with integer oracle." In 2016 Dynamics of Systems, Mechanisms and Machines (Dynamics). IEEE, 2016. http://dx.doi.org/10.1109/dynamics.2016.7819075.
Full textAmbos-Spies, Klaus. "Honest Polynomial Reducibilities, Recursively Enumerable Sets, and the P=?NP Problem." In Proceeding Structure in Complexity Theory. IEEE, 1987. http://dx.doi.org/10.1109/psct.1987.10319255.
Full textFitzsimmons, Zack, and Edith Hemaspaandra. "Insight into Voting Problem Complexity Using Randomized Classes." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/42.
Full textElorza, Anne, Leticia Hernando, and Jose A. Lozano. "Transitions from P to NP-hardness: the case of the Linear Ordering Problem." In 2022 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2022. http://dx.doi.org/10.1109/cec55065.2022.9870392.
Full textZhang, Qingyun, Zhipeng Lü, Zhouxing Su, Chumin Li, Yuan Fang, and Fuda Ma. "Vertex Weighting-Based Tabu Search for p-Center Problem." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/206.
Full textReports on the topic "P versus NP problem"
Borgwardt, Stefan, Ismail Ilkan Ceylan, and Thomas Lukasiewicz. Ontology-Mediated Queries for Probabilistic Databases. Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2023.218.
Full text