Статті в журналах з теми "Other theoretical computer science and computational mathematics, n.e.c"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Other theoretical computer science and computational mathematics, n.e.c".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
OUYANG, YONGZHONG, ZHONGHAI TANG, and YIZENG LIANG. "DENSITY FUNCTIONAL THEORY STUDY ON THE DECOMPOSITION MECHANISMS OF POLYNITROTRIPRISMANES: C6H6-n (NO2)n (n = 2, 4, 6)." Journal of Theoretical and Computational Chemistry 09, no. 03 (June 2010): 561–71. http://dx.doi.org/10.1142/s0219633610005852.
Повний текст джерелаFlajolet, Philippe, Zhicheng Gao, Andrew Odlyzko, and Bruce Richmond. "The Distribution of Heights of Binary Trees and Other Simple Trees." Combinatorics, Probability and Computing 2, no. 2 (June 1993): 145–56. http://dx.doi.org/10.1017/s0963548300000560.
Повний текст джерелаHARRINGTON, PAUL, COLM Ó. DÚNLAING, and CHEE K. YAP. "OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS." International Journal of Computational Geometry & Applications 17, no. 06 (December 2007): 555–93. http://dx.doi.org/10.1142/s0218195907002483.
Повний текст джерелаŁuczak, Tomasz, and László Pyber. "On Random Generation of the Symmetric Group." Combinatorics, Probability and Computing 2, no. 4 (December 1993): 505–12. http://dx.doi.org/10.1017/s0963548300000869.
Повний текст джерелаBARLOW, MARTIN T., JIAN DING, ASAF NACHMIAS, and YUVAL PERES. "The Evolution of the Cover Time." Combinatorics, Probability and Computing 20, no. 3 (February 15, 2011): 331–45. http://dx.doi.org/10.1017/s0963548310000489.
Повний текст джерелаBUCKNUM, MICHAEL J., CHRIS J. PICKARD, IOAN STAMATIN, and EDUARDO A. CASTRO. "ON THE STRUCTURE OF i-CARBON." Journal of Theoretical and Computational Chemistry 05, no. 02 (June 2006): 175–85. http://dx.doi.org/10.1142/s0219633606002209.
Повний текст джерелаJU, XUE-HAI, and HE-MING XIAO. "A DENSITY FUNCTIONAL THEORY INVESTIGATION ON THE TAUTOMERS AND CRYSTAL OF 2-DIAZO-4,6-DINITROPHENOL." Journal of Theoretical and Computational Chemistry 03, no. 04 (December 2004): 599–607. http://dx.doi.org/10.1142/s0219633604001239.
Повний текст джерелаArunachalam, Srinivasan, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, and Ronald De Wolf. "Improved Bounds on Fourier Entropy and Min-entropy." ACM Transactions on Computation Theory 13, no. 4 (December 31, 2021): 1–40. http://dx.doi.org/10.1145/3470860.
Повний текст джерелаADDARIO-BERRY, LOUIGI, SVANTE JANSON, and COLIN McDIARMID. "On the Spread of Random Graphs." Combinatorics, Probability and Computing 23, no. 4 (June 13, 2014): 477–504. http://dx.doi.org/10.1017/s0963548314000248.
Повний текст джерелаJiang, Tao, and Liana Yepremyan. "Supersaturation of even linear cycles in linear hypergraphs." Combinatorics, Probability and Computing 29, no. 5 (June 23, 2020): 698–721. http://dx.doi.org/10.1017/s0963548320000206.
Повний текст джерелаHamm, A., and J. Kahn. "On Erdős–Ko–Rado for random hypergraphs I." Combinatorics, Probability and Computing 28, no. 06 (June 25, 2019): 881–916. http://dx.doi.org/10.1017/s0963548319000117.
Повний текст джерелаSEIF, AHMAD, ASADOLLAH BOSHRA, MAHMOUD MIRZAEI, and MEHRAN AGHAIE. "CARBON-SUBSTITUTING IN (4,4) BORON NITRIDE NANOTUBE: DENSITY FUNCTIONAL STUDY OF BORON-11 AND NITROGEN-14 ELECTRIC FIELD GRADIENT TENSORS." Journal of Theoretical and Computational Chemistry 07, no. 03 (June 2008): 447–55. http://dx.doi.org/10.1142/s021963360800385x.
Повний текст джерелаBarger, Artem, and Dan Feldman. "Deterministic Coresets for k-Means of Big Sparse Data †." Algorithms 13, no. 4 (April 14, 2020): 92. http://dx.doi.org/10.3390/a13040092.
Повний текст джерелаJanzing, D., and P. Wocjan. "A promiseBQP-complete string rewriting problem." Quantum Information and Computation 10, no. 3&4 (March 2010): 234–57. http://dx.doi.org/10.26421/qic10.3-4-5.
Повний текст джерелаKRIVELEVICH, MICHAEL, BENNY SUDAKOV, and DAN VILENCHIK. "On the Random Satisfiable Process." Combinatorics, Probability and Computing 18, no. 5 (September 2009): 775–801. http://dx.doi.org/10.1017/s0963548309990356.
Повний текст джерелаCOLLIER-CARTAINO, CLAYTON, NATHAN GRABER, and TAO JIANG. "Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers." Combinatorics, Probability and Computing 27, no. 3 (November 2, 2017): 358–86. http://dx.doi.org/10.1017/s0963548317000530.
Повний текст джерелаZHU, WEI-WEI, SHAO-WEN ZHANG, and YI-HONG DING. "OXIDATION MECHANISM OF THE BUTADIYNYL RADICAL, C4H: ANALOGUE OF C2H OR NOT?" Journal of Theoretical and Computational Chemistry 12, no. 06 (September 2013): 1340002. http://dx.doi.org/10.1142/s0219633613400026.
Повний текст джерелаMarton, Katalin. "Logarithmic Sobolev inequalities in discrete product spaces." Combinatorics, Probability and Computing 28, no. 06 (June 13, 2019): 919–35. http://dx.doi.org/10.1017/s0963548319000099.
Повний текст джерелаBalakrishnan, AbhayRam, R. Shankar, and S. Vijayakumar. "Reduced bond length alternation and helical molecular orbitals in donor and acceptor substituted linear carbon chains." Journal of Theoretical and Computational Chemistry 17, no. 08 (December 2018): 1850049. http://dx.doi.org/10.1142/s0219633618500499.
Повний текст джерелаSardharwalla, Imdad S. B., Sergii Strelchuk, and Richard Jozsa. "Quantum conditional query complexity." Quantum Information and Computation 17, no. 7&8 (May 2017): 541–67. http://dx.doi.org/10.26421/qic17.7-8-1.
Повний текст джерелаHorn, Paul S. "A First Course in Order Statistics (Barry C. Arnold, N. Balakrishnan, and H. N. Nagaraja)." SIAM Review 35, no. 3 (September 1993): 525. http://dx.doi.org/10.1137/1035120.
Повний текст джерелаNotz, William I. "Optimum Experimental Designs (A. C. Atkinson and A. N. Donev)." SIAM Review 36, no. 2 (June 1994): 315–16. http://dx.doi.org/10.1137/1036083.
Повний текст джерелаKaper, Hans G. "Ordinary Differential Equations in $R^n $—Problems and Methods (L. C. Piccinini, G. Stampacchia and G. Vidossich)." SIAM Review 27, no. 4 (December 1985): 596–98. http://dx.doi.org/10.1137/1027168.
Повний текст джерелаADEGEEST, JOHN, MARK OVERMARS, and JACK SNOEYINK. "MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES." International Journal of Computational Geometry & Applications 04, no. 01 (March 1994): 39–51. http://dx.doi.org/10.1142/s0218195994000045.
Повний текст джерелаZHENG, WENXU, CHUNG WING LEUNG, ZHONGYUAN ZHOU, CHAK PO LAU та ZHENYANG LIN. "STRUCTURE DETERMINATION OF TpRu(PPh3){κ2-N, O-NH=C(Ph)N=C(Ph)O}: A STORY OF HOW COMPUTATIONAL STUDIES CONTRIBUTE TO THE STRUCTURAL CHARACTERIZATION PROCESS". Journal of Theoretical and Computational Chemistry 08, № 03 (червень 2009): 417–22. http://dx.doi.org/10.1142/s021963360900471x.
Повний текст джерелаAHN, HEE-KAP, MOHAMMAD FARSHI, CHRISTIAN KNAUER, MICHIEL SMID, and YAJUN WANG. "DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES." International Journal of Computational Geometry & Applications 20, no. 01 (February 2010): 69–87. http://dx.doi.org/10.1142/s0218195910003207.
Повний текст джерелаGÖRKE, ROBERT, CHAN-SU SHIN, and ALEXANDER WOLFF. "CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER." International Journal of Computational Geometry & Applications 18, no. 04 (August 2008): 275–94. http://dx.doi.org/10.1142/s0218195908002623.
Повний текст джерелаTANG, ZHENG-XIN, XIAO-HONG LI, RUI-ZHOU ZHANG, and XIAN-ZHOU ZHANG. "THEORETICAL STUDIES ON HEATS OF FORMATION OF PYRIDINE N-OXIDES USING DENSITY FUNCTIONAL THEORY AND COMPLETE BASIS METHOD." Journal of Theoretical and Computational Chemistry 08, no. 04 (August 2009): 541–49. http://dx.doi.org/10.1142/s0219633609004897.
Повний текст джерелаLIU, MIN HSIEN, and GEN FA ZHENG. "COMPUTATIONAL STUDY OF UNIMOLECULAR DECOMPOSITION MECHANISM OF RDX EXPLOSIVE." Journal of Theoretical and Computational Chemistry 06, no. 02 (June 2007): 341–51. http://dx.doi.org/10.1142/s0219633607002952.
Повний текст джерелаKölbig, K. S. "Calculation of Special Functions, the Gamma Function, the Exponential Integrals and Error-Like Functions (C. G. van der Laan and N. M. Temme)." SIAM Review 29, no. 4 (December 1987): 660–61. http://dx.doi.org/10.1137/1029138.
Повний текст джерелаShahrokhi, F., O. Sýkora, L. A. Székely, and I. Vrt'o. "Intersection of Curves and Crossing Number of C m × C n on Surfaces." Discrete & Computational Geometry 19, no. 2 (February 1998): 237–47. http://dx.doi.org/10.1007/pl00009343.
Повний текст джерелаLENHOF, HANS-PETER, and MICHIEL SMID. "AN OPTIMAL CONSTRUCTION METHOD FOR GENERALIZED CONVEX LAYERS." International Journal of Computational Geometry & Applications 03, no. 03 (September 1993): 245–67. http://dx.doi.org/10.1142/s0218195993000166.
Повний текст джерелаRAMALHO, TEODORICO C., ELAINE F. F. DA CUNHA, FERNANDO C. PEIXOTO, and JOSÉ DANIEL FIGUEROA-VILLAR. "COMPUTATIONAL NMR INVESTIGATION OF RADIOSENSITIZER IN SOLUTION." Journal of Theoretical and Computational Chemistry 07, no. 01 (February 2008): 37–52. http://dx.doi.org/10.1142/s0219633608003575.
Повний текст джерелаDell, Holger, and John Lapinskas. "Fine-Grained Reductions from Approximate Counting to Decision." ACM Transactions on Computation Theory 13, no. 2 (June 2021): 1–24. http://dx.doi.org/10.1145/3442352.
Повний текст джерелаLi, Lei, Hongwei Fan, Hezhuan Wei, Shengli An, and Guixiao Jia. "[2+1] Additions of (n,0)(n=6−10) single-walled carbon nanotubes with di-vacancies based on defect curvature: A first-principles study." Journal of Theoretical and Computational Chemistry 18, no. 01 (February 2019): 1950004. http://dx.doi.org/10.1142/s0219633619500044.
Повний текст джерелаKlazar, Martin. "On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects." Electronic Journal of Combinatorics 15, no. 1 (May 31, 2008). http://dx.doi.org/10.37236/799.
Повний текст джерелаVyas, Nikhil, and R. Ryan Williams. "Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms." Theory of Computing Systems, November 4, 2022. http://dx.doi.org/10.1007/s00224-022-10106-8.
Повний текст джерелаKlazar, Martin. "Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs." Electronic Journal of Combinatorics 7, no. 1 (May 23, 2000). http://dx.doi.org/10.37236/1512.
Повний текст джерелаMeagher, Karen, and Lucia Moura. "Erdős-Ko-Rado theorems for uniform set-partition systems." Electronic Journal of Combinatorics 12, no. 1 (August 25, 2005). http://dx.doi.org/10.37236/1937.
Повний текст джерелаDvořák, Vojtěch. "$P_{n}$-Induced-Saturated Graphs Exist for all $n \geqslant 6$." Electronic Journal of Combinatorics 27, no. 4 (December 11, 2020). http://dx.doi.org/10.37236/9579.
Повний текст джерелаBender, Edward A., and E. Rodney Canfield. "Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities." Electronic Journal of Combinatorics 17, no. 1 (October 29, 2010). http://dx.doi.org/10.37236/417.
Повний текст джерелаHan, Jie, Yoshiharu Kohayakawa, and Yury Person. "Near-perfect clique-factors in sparse pseudorandom graphs." Combinatorics, Probability and Computing, December 11, 2020, 1–21. http://dx.doi.org/10.1017/s0963548320000577.
Повний текст джерелаGessel, Ira M., and Seunghyun Seo. "A Refinement of Cayley's Formula for Trees." Electronic Journal of Combinatorics 11, no. 2 (February 8, 2006). http://dx.doi.org/10.37236/1884.
Повний текст джерелаFrieze, Alan, and Wesley Pegden. "Between 2- and 3-Colorability." Electronic Journal of Combinatorics 22, no. 1 (February 16, 2015). http://dx.doi.org/10.37236/4673.
Повний текст джерелаKari, Jarkko, and Etienne Moutot. "Decidability and Periodicity of Low Complexity Tilings." Theory of Computing Systems, October 28, 2021. http://dx.doi.org/10.1007/s00224-021-10063-8.
Повний текст джерелаClearman, Samuel, Matthew Hyatt, Brittany Shelton, and Mark Skandera. "Evaluations of Hecke Algebra Traces at Kazhdan-Lusztig Basis Elements." Electronic Journal of Combinatorics 23, no. 2 (April 15, 2016). http://dx.doi.org/10.37236/5021.
Повний текст джерелаIsgur, Abraham, David Reiss, and Stephen Tanny. "Trees and Meta-Fibonacci Sequences." Electronic Journal of Combinatorics 16, no. 1 (October 31, 2009). http://dx.doi.org/10.37236/218.
Повний текст джерелаSulanke, Robert A. "Generalizing Narayana and Schröder Numbers to Higher Dimensions." Electronic Journal of Combinatorics 11, no. 1 (August 23, 2004). http://dx.doi.org/10.37236/1807.
Повний текст джерелаPittel, Boris, and Ji-A. Yeum. "How Frequently is a System of $2$-Linear Boolean Equations Solvable?" Electronic Journal of Combinatorics 17, no. 1 (June 29, 2010). http://dx.doi.org/10.37236/364.
Повний текст джерелаSpiro, Sam. "Saturation Games for Odd Cycles." Electronic Journal of Combinatorics 26, no. 4 (October 11, 2019). http://dx.doi.org/10.37236/8113.
Повний текст джерела