Статті в журналах з теми "NP-complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "NP-complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Vardi, Moshe Y. "On P, NP, and computational complexity." Communications of the ACM 53, no. 11 (November 2010): 5. http://dx.doi.org/10.1145/1839676.1839677.
Повний текст джерелаde Haan, Ronald, and Stefan Szeider. "Parameterized complexity classes beyond para-NP." Journal of Computer and System Sciences 87 (August 2017): 16–57. http://dx.doi.org/10.1016/j.jcss.2017.02.002.
Повний текст джерелаJiang, Yaozhi. "A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine." Journal of Mathematics Research 12, no. 4 (July 7, 2020): 1. http://dx.doi.org/10.5539/jmr.v12n4p1.
Повний текст джерелаBeame, Paul, Stephen Cook, Jeff Edmonds, Russell Impagliazzo, and Toniann Pitassi. "The Relative Complexity of NP Search Problems." Journal of Computer and System Sciences 57, no. 1 (August 1998): 3–19. http://dx.doi.org/10.1006/jcss.1998.1575.
Повний текст джерелаCALUDE, CRISTIAN S., ELENA CALUDE, and MELISSA S. QUEEN. "INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM." Parallel Processing Letters 23, no. 01 (March 2013): 1350007. http://dx.doi.org/10.1142/s0129626413500072.
Повний текст джерелаLittman, M. L., J. Goldsmith, and M. Mundhenk. "The Computational Complexity of Probabilistic Planning." Journal of Artificial Intelligence Research 9 (August 1, 1998): 1–36. http://dx.doi.org/10.1613/jair.505.
Повний текст джерелаJukna, Stasys. "On the P versus NP intersected with co-NP question in communication complexity." Information Processing Letters 96, no. 6 (December 2005): 202–6. http://dx.doi.org/10.1016/j.ipl.2005.08.003.
Повний текст джерелаMulmuley, Ketan D. "On P vs. NP and geometric complexity theory." Journal of the ACM 58, no. 2 (April 2011): 1–26. http://dx.doi.org/10.1145/1944345.1944346.
Повний текст джерелаBirget, J. C. "Inverse monoids associated with the complexity class NP." Semigroup Forum 98, no. 2 (January 3, 2019): 369–97. http://dx.doi.org/10.1007/s00233-018-9990-x.
Повний текст джерелаBuss, Samuel R. "Towards NP–P via proof complexity and search." Annals of Pure and Applied Logic 163, no. 7 (July 2012): 906–17. http://dx.doi.org/10.1016/j.apal.2011.09.009.
Повний текст джерелаDíez-Bedmar, María Belén, and Pascual Pérez-Paredes. "Noun phrase complexity in young Spanish EFL learners’ writing." International Journal of Corpus Linguistics 25, no. 1 (April 16, 2020): 4–35. http://dx.doi.org/10.1075/ijcl.17058.die.
Повний текст джерелаIoannou, L. M. "Computational complexity of the quantum separability problem." Quantum Information and Computation 7, no. 4 (May 2007): 336–70. http://dx.doi.org/10.26421/qic7.4-5.
Повний текст джерелаFu, Bin, and Hong-Zhou Li. "Closeness of NP-Hard Sets to Other Complexity Classes." SIAM Journal on Computing 23, no. 2 (April 1994): 255–60. http://dx.doi.org/10.1137/s0097539792225935.
Повний текст джерелаDieu, Phan Dinh, Le Cong Thanh, and Le Tuan Hoa. "Average polynomial time complexity of some NP-complete problems." Theoretical Computer Science 46 (1986): 219–37. http://dx.doi.org/10.1016/0304-3975(86)90031-9.
Повний текст джерелаBIRGET, JEAN-CAMILLE. "THE THOMPSON–HIGMAN MONOIDS Mk,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY." International Journal of Algebra and Computation 21, no. 01n02 (February 2011): 1–34. http://dx.doi.org/10.1142/s0218196711006066.
Повний текст джерелаJonsson, Peter, Victor Lagerkvist, and Biman Roy. "Fine-Grained Time Complexity of Constraint Satisfaction Problems." ACM Transactions on Computation Theory 13, no. 1 (March 2021): 1–32. http://dx.doi.org/10.1145/3434387.
Повний текст джерелаSchilk, Marco, and Steffen Schaub. "Noun phrase complexity across varieties of English." English World-Wide 37, no. 1 (March 3, 2016): 58–85. http://dx.doi.org/10.1075/eww.37.1.03sch.
Повний текст джерелаAkinlotan, Mayowa, and Alex Housen. "Noun phrase complexity in Nigerian English." English Today 33, no. 3 (January 30, 2017): 31–38. http://dx.doi.org/10.1017/s0266078416000626.
Повний текст джерелаMandal, C. A., P. P. Chakrabarti, and S. Ghose. "Complexity of Scheduling in High Level Synthesis." VLSI Design 7, no. 4 (January 1, 1998): 337–46. http://dx.doi.org/10.1155/1998/52807.
Повний текст джерелаMeier, Arne. "Incremental FPT Delay." Algorithms 13, no. 5 (May 15, 2020): 122. http://dx.doi.org/10.3390/a13050122.
Повний текст джерелаDe Haan, Ronald, Iyad Kanj, and Stefan Szeider. "On the Subexponential-Time Complexity of CSP." Journal of Artificial Intelligence Research 52 (January 30, 2015): 203–34. http://dx.doi.org/10.1613/jair.4540.
Повний текст джерелаAnnila, Arto. "Physical Portrayal of Computational Complexity." ISRN Computational Mathematics 2012 (March 5, 2012): 1–15. http://dx.doi.org/10.5402/2012/321372.
Повний текст джерелаKo, Ker-I., and Uwe Schöning. "On Circuit-Size Complexity and the Low Hierarchy in NP." SIAM Journal on Computing 14, no. 1 (February 1985): 41–51. http://dx.doi.org/10.1137/0214003.
Повний текст джерелаCHEN, ZHI-ZHONG, and SEINOSUKE TODA. "ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS." International Journal of Foundations of Computer Science 02, no. 03 (September 1991): 207–20. http://dx.doi.org/10.1142/s0129054191000133.
Повний текст джерелаBERGMAN, CLIFFORD, and GIORA SLUTZKI. "COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA." International Journal of Algebra and Computation 12, no. 05 (October 2002): 719–35. http://dx.doi.org/10.1142/s0218196702001127.
Повний текст джерелаCook, Stephen, and Jan Krajíček. "Consequences of the provability of NP ⊆ P/poly." Journal of Symbolic Logic 72, no. 4 (December 2007): 1353–71. http://dx.doi.org/10.2178/jsl/1203350791.
Повний текст джерелаBonatti, P. A., C. Lutz, and F. Wolter. "The Complexity of Circumscription in DLs." Journal of Artificial Intelligence Research 35 (August 26, 2009): 717–73. http://dx.doi.org/10.1613/jair.2763.
Повний текст джерелаHEMASPAANDRA, LANE A., ALBRECHT HOENE, ASHISH V. NAIK, MITSUNORI OGIHARA, ALAN L. SELMAN, THOMAS THIERAUF, and JIE WANG. "NONDETERMINISTICALLY SELECTIVE SETS." International Journal of Foundations of Computer Science 06, no. 04 (December 1995): 403–16. http://dx.doi.org/10.1142/s0129054195000214.
Повний текст джерелаIlyas, Tahir. "Quantum Limits, Computational Complexity and Philosophy – A Review." Lahore Garrison University Research Journal of Computer Science and Information Technology 2, no. 1 (April 22, 2020): 9–20. http://dx.doi.org/10.54692/lgurjcsit.2018.020139.
Повний текст джерелаHitchcock, John M., Adewale Sekoni, and Hadi Shafei. "Polynomial-Time Random Oracles and Separating Complexity Classes." ACM Transactions on Computation Theory 13, no. 1 (March 2021): 11–16. http://dx.doi.org/10.1145/3434389.
Повний текст джерелаKreyer, Rolf, and Steffen Schaub. "The development of phrasal complexity in German intermediate learners of English." International Journal of Learner Corpus Research 4, no. 1 (May 31, 2018): 82–111. http://dx.doi.org/10.1075/ijlcr.16011.kre.
Повний текст джерелаAdelson-Velsky, George M., Alexander Gelbukh, and Eugene Levner. "On fast path-finding algorithms in AND-OR graphs." Mathematical Problems in Engineering 8, no. 4-5 (2002): 283–93. http://dx.doi.org/10.1080/10241230306728.
Повний текст джерелаHartarsky, Ivailo, and Tamás Róbert Mezei. "Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness." SIAM Journal on Discrete Mathematics 34, no. 2 (January 2020): 1444–59. http://dx.doi.org/10.1137/19m1239933.
Повний текст джерелаChen, Jian-Er. "Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness." Journal of Computer Science and Technology 20, no. 1 (January 2005): 18–37. http://dx.doi.org/10.1007/s11390-005-0003-7.
Повний текст джерелаTunçel, Levent. "Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard." Mathematical Programming 86, no. 1 (September 1, 1999): 219–23. http://dx.doi.org/10.1007/s101070050087.
Повний текст джерелаSanchis, Laura A. "On the complexity of test case generation for NP-hard problems." Information Processing Letters 36, no. 3 (November 1990): 135–40. http://dx.doi.org/10.1016/0020-0190(90)90082-9.
Повний текст джерелаKharlampovich, Olga, and Alina Vdovina. "Low complexity algorithms in knot theory." International Journal of Algebra and Computation 29, no. 02 (March 2019): 245–62. http://dx.doi.org/10.1142/s0218196718500698.
Повний текст джерелаBäckström, C., and P. Jonsson. "A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond." Journal of Artificial Intelligence Research 47 (July 30, 2013): 575–611. http://dx.doi.org/10.1613/jair.3968.
Повний текст джерелаSeki, Shinnosuke, and Andrew Winslow. "The Complexity of Fixed-Height Patterned Tile Self-Assembly." International Journal of Foundations of Computer Science 28, no. 05 (August 2017): 465–82. http://dx.doi.org/10.1142/s0129054117400020.
Повний текст джерелаDURRLEMAN, STEPHANIE, THEODOROS MARINIS, and JULIE FRANCK. "Syntactic complexity in the comprehension of wh-questions and relative clauses in typical language development and autism." Applied Psycholinguistics 37, no. 6 (March 29, 2016): 1501–27. http://dx.doi.org/10.1017/s0142716416000059.
Повний текст джерелаValencia-Cabrera, Luis, David Orellana-Martín, Miguel Á. Martínez-del-Amor, Ignacio Pérez-Hurtado, and Mario J. Pérez-Jiménez. "From NP-Completeness to DP-Completeness: A Membrane Computing Perspective." Complexity 2020 (August 30, 2020): 1–10. http://dx.doi.org/10.1155/2020/6765097.
Повний текст джерелаChia, Nai-Hui, Sean Hallgren, and Fang Song. "On Basing One-way Permutations on NP-hard Problems under Quantum Reductions." Quantum 4 (August 27, 2020): 312. http://dx.doi.org/10.22331/q-2020-08-27-312.
Повний текст джерелаMorgan, Perri, Christine M. Everett, Valerie A. Smith, Sandra Woolson, David Edelman, Cristina C. Hendrix, Theodore S. Z. Berkowitz, Brandolyn White, and George L. Jackson. "Factors Associated With Having a Physician, Nurse Practitioner, or Physician Assistant as Primary Care Provider for Veterans With Diabetes Mellitus." INQUIRY: The Journal of Health Care Organization, Provision, and Financing 54 (January 1, 2017): 004695801771276. http://dx.doi.org/10.1177/0046958017712762.
Повний текст джерелаStewart, Iain A. "Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines." Fundamenta Informaticae 18, no. 1 (January 1, 1993): 65–92. http://dx.doi.org/10.3233/fi-1993-18105.
Повний текст джерелаProcaccia, A. D., and J. S. Rosenschein. "Junta Distributions and the Average-Case Complexity of Manipulating Elections." Journal of Artificial Intelligence Research 28 (February 28, 2007): 157–81. http://dx.doi.org/10.1613/jair.2148.
Повний текст джерелаBRUNNER, THOMAS. "Structural nativization, typology and complexity: noun phrase structures in British, Kenyan and Singaporean English." English Language and Linguistics 18, no. 1 (February 6, 2014): 23–48. http://dx.doi.org/10.1017/s1360674313000269.
Повний текст джерелаLeung, Joseph Y. T., and Burkhard Monien. "On the Complexity of Deadlock Recovery." Fundamenta Informaticae 9, no. 3 (July 1, 1986): 323–42. http://dx.doi.org/10.3233/fi-1986-9304.
Повний текст джерелаAkinlotan, Mayowa. "Noun phrase complement in Nigerian English." BELT - Brazilian English Language Teaching Journal 9, no. 2 (January 15, 2019): 342. http://dx.doi.org/10.15448/2178-3640.2018.2.31724.
Повний текст джерелаLiu, J. F., and K. A. Abdel-Malek. "On the Problem of Scheduling Parallel Computations of Multibody Dynamic Analysis." Journal of Dynamic Systems, Measurement, and Control 121, no. 3 (September 1, 1999): 370–76. http://dx.doi.org/10.1115/1.2802484.
Повний текст джерелаLIN, YAW-LING, and STEVEN S. SKIENA. "COMPLEXITY ASPECTS OF VISIBILITY GRAPHS." International Journal of Computational Geometry & Applications 05, no. 03 (September 1995): 289–312. http://dx.doi.org/10.1142/s0218195995000179.
Повний текст джерела