22641 - 22650 out of 25,941Page size: 10
Sort by: Title

  1. Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank

    Kogabaev, N. T., 1 Mar 2018, In: Siberian Mathematical Journal. 59, 2, p. 295-308 14 p.

    Research output: Contribution to journal › Article › peer-review

  2. Complexity of the circulant foliation over a graph

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., Feb 2021, In: Journal of Algebraic Combinatorics. 53, 1, p. 115-129 15 p.

    Research output: Contribution to journal › Article › peer-review

  3. Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Jan 2020, In: Computational Mathematics and Mathematical Physics. 60, 1, p. 163-170 8 p.

    Research output: Contribution to journal › Article › peer-review

  4. Complexity of Discrete Seifert Foliations over a Graph

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., 1 May 2019, In: Doklady Mathematics. 99, 3, p. 286-289 4 p.

    Research output: Contribution to journal › Article › peer-review

  5. Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics

    Mednykh, A. & Mednykh, I., 2022, In: Ars Mathematica Contemporanea. 23, 1, 2530.

    Research output: Contribution to journal › Article › peer-review

  6. Complexity of arc routing problems

    van Bevern, R., Niedermeier, R., Sorge, M. & Weller, M., 2015, Arc Routing: Problems, Methods, and Applications. Corberan, Á. & Laporte, G. (eds.). Society for Industrial and Applied Mathematics Publications, p. 19-52 34 p. (MOS-SIAM Series on Optimization; vol. 20).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review

  7. Complexity of approximating functions on real-life computers

    Ryabko, B., 25 Jan 2015, In: International Journal of Foundations of Computer Science. 26, 1, p. 153-157 5 p.

    Research output: Contribution to journal › Article › peer-review

  8. Complexity for partial computable functions over computable Polish spaces

    Korovina, M. & Kudinov, O., 1 Mar 2018, In: Mathematical Structures in Computer Science. 28, 3, p. 429-447 19 p.

    Research output: Contribution to journal › Article › peer-review

  9. Complex Fully Connected Neural Networks for Nonlinearity Compensation in Long-Haul Transmission Systems

    Bogdanov, S. & Sidelnikov, O., Jun 2021, 2021 Conference on Lasers and Electro-Optics Europe and European Quantum Electronics Conference, CLEO/Europe-EQEC 2021. Institute of Electrical and Electronics Engineers Inc., 1 p. (2021 Conference on Lasers and Electro-Optics Europe and European Quantum Electronics Conference, CLEO/Europe-EQEC 2021; vol. 2021-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. Complex fully connected neural networks for nonlinearity compensation in long-haul transmission systems

    Bogdanov, S. & Sidelnikov, O., 2021, The European Conference on Lasers and Electro-Optics, CLEO/Europe 2021. The Optical Society, ci_p_7. (Optics InfoBase Conference Papers).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Previous 1...2261 2262 2263 2264 2265 2266 2267 2268 ...2595 Next