Suchergebnisse - "Quasi-polynomial algorithm"

  • Treffer 1 - 6 von 6
Treffer weiter einschränken
  1. 1

    Aspects of the commuting graph

    Autoren: Arvind, V. Cameron, Peter J. Ma, Xuanlong et al.

    Quelle: Arvind , V , Cameron , P J , Ma , X & Maslova , N 2025 , ' Aspects of the commuting graph ' , Journal of Algebra . https://doi.org/10.1016/j.jalgebra.2025.07.020

    Schlagwörter: Commuting graph, Finite group, Quasi-polynomial algorithm

    Verfügbarkeit: https://research-portal.st-andrews.ac.uk/en/publications/601434b9-30eb-4211-a727-6ac7c40e0465
    https://doi.org/10.1016/j.jalgebra.2025.07.020
    https://arxiv.org/abs/2305.07301

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Computation of a 30 750-Bit Binary Field Discrete Logarithm

    Autoren: Granger, Robert Kleinjung, Thorsten Lenstra, Arjen et al.

    Weitere Verfasser: Granger, Robert Kleinjung, Thorsten Lenstra, Arjen et al.

    Quelle: ISSN: 0025-5718 ; Mathematics of Computation ; https://hal.archives-ouvertes.fr/hal-02945361 ; Mathematics of Computation, American Mathematical Society, 2021, 90 (332.

    Schlagwörter: Quasi-polynomial algorithm, Binary fields, Finite fields, Discrete logarithm problem, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

    Relation: hal-02945361; https://hal.archives-ouvertes.fr/hal-02945361; https://hal.archives-ouvertes.fr/hal-02945361/document; https://hal.archives-ouvertes.fr/hal-02945361/file/2020-965.pdf

    Verfügbarkeit: https://hal.archives-ouvertes.fr/hal-02945361
    https://hal.archives-ouvertes.fr/hal-02945361/document
    https://hal.archives-ouvertes.fr/hal-02945361/file/2020-965.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    Computation of a 30750-bit binary field discrete logarithm

    Autoren: Granger, Robert Kleinjung, Thorsten Lenstra, Arjen et al.

    Weitere Verfasser: Granger, Robert Kleinjung, Thorsten Lenstra, Arjen et al.

    Quelle: Mathematics of Computation.

    Schlagwörter: Mathematics - Number Theory, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, 11Y16, 11T71, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Finite fields, Quasi-polynomial algorithm, Number Theory (math.NT), Discrete logarithm problem, Binary fields, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

    Dateibeschreibung: application/pdf

    Zugangs-URL: https://www.ams.org/mcom/2021-90-332/S0025-5718-2021-03669-8/S0025-5718-2021-03669-8.pdf
    http://arxiv.org/abs/2008.02717
    https://hal.science/hal-02945361v1
    https://hal.science/hal-02945361v1/document
    https://doi.org/10.1090/mcom/3669
    https://infoscience.epfl.ch/record/288555
    https://www.ams.org/journals/mcom/2021-90-332/S0025-5718-2021-03669-8/
    https://hal.inria.fr/hal-02945361/
    https://hal.archives-ouvertes.fr/hal-02945361v1
    https://dblp.uni-trier.de/db/journals/moc/moc90.html#GrangerKLWZ21
    https://hal.archives-ouvertes.fr/hal-02945361/document

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    ТОЧНЫЙ АЛГОРИТМ ДЛЯ РЕШЕНИЯ ОДНОГО ЧАСТНОГО СЛУЧАЯ ЗАДАЧИ ВЕБЕРА В ДИСКРЕТНОЙ ПОСТАНОВКЕ

    Autoren: Шангин, Роман

    Schlagwörter: ЗАДАЧА ВЕБЕРА,П-ПОСЛЕДОВАТЕЛЬНОСВЯЗНАЯ ЦЕПЬ,ДИНАМИЧЕСКОЕ ПРОГРАММИРОВАНИЕ,ТОЧНЫЙ АЛГОРИТМ,КВАЗИПОЛИНОМИАЛЬНЫЙ АЛГОРИТМ,WEBER PROBLEM,N-SEQUENTIALLY CONNECTED CHAIN,DYNAMIC PROGRAMMING,EXACT ALGORITHM,QUASI-POLYNOMIAL ALGORITHM

    Dateibeschreibung: text/html

    Verfügbarkeit: http://cyberleninka.ru/article/n/tochnyy-algoritm-dlya-resheniya-odnogo-chastnogo-sluchaya-zadachi-vebera-v-diskretnoy-postanovke
    http://cyberleninka.ru/article_covers/14466949.png

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    A class of special combinatorial optimization problems and their algorithms

    Autoren: Luo, Zongjun

    Schlagwörter: Combinatorial optimization, dynamic programming algorithm, polynomial algorithm, Programming involving graphs or networks, quasi-polynomial algorithm

    Dateibeschreibung: application/xml

    Zugangs-URL: https://zbmath.org/1382333

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    Integer programming problems with fuzzy coefficients of the right-hand side

    Autoren: Zhargal, D. Lebedev, S. S.

    Schlagwörter: \(\lambda \) -optimal solution, perturbation, Linear programming, Integer programming, quasi-polynomial algorithm, Theory of fuzzy sets, etc, integer linear programming

    Dateibeschreibung: application/xml

    Zugangs-URL: https://zbmath.org/4085415

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: