11251 - 11260 out of 26,356Page size: 10
Sort by: Title

  1. Polynomial-Time Solvability of the One-Dimensional Case of an NP-Hard Clustering Problem

    Kel’manov, A. V. & Khandeev, V. I., 1 Sept 2019, In: Computational Mathematics and Mathematical Physics. 59, 9, p. 1553-1561 9 p.

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

  2. Polynomial-Time Solvability of One Optimization Problem Induced by Processing and Analyzing Quasiperiodic ECG and PPG Signals

    Kel’manov, A., Khamidullin, S., Mikhailova, L. & Ruzankin, P., 1 Jan 2020, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Jaćimović, M., Khachay, M., Malkova, V. & Posypkin, M. (eds.). Springer Gabler, p. 88-101 14 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

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

  3. Polynomial-time presentations of algebraic number fields

    Alaev, P. & Selivanov, V., 1 Jan 2018, Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Proceedings. Manea, F., Miller, RG. & Nowotka, D. (eds.). Springer, p. 20-29 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10936 LNCS).

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

  4. Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation

    Khandeev, V., 1 Jan 2020, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Sergeyev, Y. D. & Kvasov, D. E. (eds.). Springer Gabler, p. 400-405 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11974 LNCS).

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

  5. Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center

    Kel’manov, A. V. & Motkova, A. V., 1 Jan 2018, In: Computational Mathematics and Mathematical Physics. 58, 1, p. 130-136 7 p.

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

  6. Polynomial non-integrability of magnetic billiards on the sphere and the hyperbolic plane

    Bialy, M. & Mironov, A. E., 16 Jan 2019, In: Russian Mathematical Surveys. 74, 2, p. 187-209 23 p., 1.

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

  7. Polynomially Computable Structures with Finitely Many Generators

    Alaev, P. E., Jul 2020, In: Algebra and Logic. 59, 3, p. 266-272 7 p.

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

  8. Polynomial integrals of magnetic geodesic flows on the 2-torus on several energy levels

    Agapov, S. & Valyuzhenich, A., Nov 2019, In: Discrete and Continuous Dynamical Systems- Series A. 39, 11, p. 6565-6583 19 p.

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

  9. Polynomial Exact Schedulability and Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor Platforms

    Garanina, N., Anureev, I. & Kondratyev, D., 20 Jan 2025, In: Applied System Innovation. 8, 1, 15.

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

  10. Polynomial Computability of Fields of Algebraic Numbers

    Alaev, P. E. & Selivanov, V. L., 1 Jul 2018, In: Doklady Mathematics. 98, 1, p. 341-343 3 p.

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

Previous 1...1122 1123 1124 1125 1126 1127 1128 1129 ...2636 Next