Výsledky vyhledávání - "complexity of algorithms"

Approximation algorithms for solving the heterogeneous rooted tree/path cover problems

Autoři: Pengxiang Pan Junran Lichen Ping Yang a další

Zdroj: Journal of Combinatorial Optimization. 49

Témata: nonuniform speeds, rooted tree/path cover, complexity of algorithms, Mathematical programming, approximation algorithms

Popis souboru: application/xml

Symbolic Computation with Symmetric Polynomials in Real Algebraic Geometry

Autoři: Riener, Cordian Vu, Thi, Xuan The Arctic University of Norway Tromsø, Norway (UiT) a další

Přispěvatelé: Riener, Cordian Vu, Thi, Xuan The Arctic University of Norway Tromsø, Norway (UiT) a další

Zdroj: https://hal.science/hal-05199132 ; 2025.

Témata: invariant theory symmetric polynomials computational complexity efficient algorithms, invariant theory, symmetric polynomials, computational complexity, efficient algorithms, [INFO]Computer Science [cs], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]

Dostupnost: https://hal.science/hal-05199132
https://hal.science/hal-05199132v1/document
https://hal.science/hal-05199132v1/file/symmetric.pdf

A deterministic algorithm for the discrete logarithm problem in a semigroup

Autoři: Tinani, Simran Rosenthal, Joachim University of Zurich

Přispěvatelé: Tinani, Simran Rosenthal, Joachim University of Zurich

Zdroj: Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 141-155 (2022)

Témata: FOS: Computer and information sciences, discrete logarithm problem, Group Theory (math.GR), 02 engineering and technology, 68q25, Computational Complexity (cs.CC), 01 natural sciences, semigroups, 510 Mathematics, 2604 Applied Mathematics, 1706 Computer Science Applications, complexity of algorithms, QA1-939, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, 94a60, Applied Mathematics, 20m13, Computer Science Applications, 10123 Institute of Mathematics, Computational Mathematics, Computer Science - Computational Complexity, 2605 Computational Mathematics, Mathematics - Group Theory, Mathematics

Popis souboru: Rosenthal_2022_ADeterministicAlgorithm.pdf - application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2101.11500
https://doaj.org/article/dce4f7c6cf5340c5a48cd71e503fbd93
https://www.zora.uzh.ch/id/eprint/219472/
https://doi.org/10.5167/uzh-219472

Proving NP ≠ PSPACE with Dynamic ChaosSpace: A Lean 4 Formalization with Optimized Parameters

Autoři: Ednyashev, Sanal

Témata: P ≠ NP, Lean 4, Formal Proof, ChaosSpace, 3SAT, Computational Complexity, Local Algorithms

ChaosSpace: A Lean 4 Formalization of P ≠ NP

Autoři: Ednyashev, Sanal

Témata: P ≠ NP, Lean 4, Formal Proof, ChaosSpace, 3SAT, Computational Complexity, Local Algorithms

'Proving P ≠ NP with ChaosSpace: A Lean 4 Formalization with Optimized Parameters

Autoři: Ednyashev, Sanal

Témata: P ≠ NP, Lean 4, Formal Proof, ChaosSpace, 3SAT, Computational Complexity, Local Algorithms

A variant of the large sieve inequality with explicit constants

Autoři: Maciej Grzeskowiak

Zdroj: Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 307-315 (2020)

Témata: 11n36, 11l40, QA1-939, 0102 computer and information sciences, 68q25, 0101 mathematics, computational complexity of algorithms, 01 natural sciences, lage sieve, Mathematics

Přístupová URL adresa: https://www.degruyter.com/document/doi/10.1515/jmc-2019-0022/pdf
https://doaj.org/article/4007a51c22e146f99af81987d36ee03b
https://dblp.uni-trier.de/db/journals/jmc/jmc14.html#Grzeskowiak20

Bellman-Ford is optimal for shortest hop-bounded paths

Autoři: Kociumaka, Tomasz Polak, Adam Tomasz Kociumaka and Adam Polak

Přispěvatelé: Kociumaka, Tomasz Polak, Adam Tomasz Kociumaka and Adam Polak

Témata: graph algorithms, FOS: Computer and information sciences, shortest paths, Fine-grained complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, FINE-GRAINED COMPLEXITY, GRAPH ALGORITHMS, LOWER BOUNDS, SHORTEST PATHS, lower bounds, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2211.07325
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.72
https://hdl.handle.net/11565/4061822
https://doi.org/10.4230/lipics.esa.2023.72

Optimal Algorithms for Compact Linear Layouts

Autoři: Willem Sonke Eric Verbeek Wouter Meulemans a další

Zdroj: 2018 IEEE Pacific Visualization Symposium (PacificVis). :1-10

Témata: Graph/Network Data, Geometry based Techniques, 11. Sustainability, Folding, Linear layouts, F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems, 0102 computer and information sciences, Routing and layout, 01 natural sciences

Přístupová URL adresa: https://research.tue.nl/en/publications/2e370ddf-e3bd-4d42-87f7-53d8bb312fdf
https://research.tue.nl/en/publications/optimal-algorithms-for-compact-linear-layouts-2
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ff550cf2b-aef8-4e45-ac94-300fb43ddd2c
https://ieeexplore.ieee.org/document/8365970/
https://dblp.uni-trier.de/db/conf/apvis/pacificvis2018.html#SonkeVMVS18
http://doi.ieeecomputersociety.org/10.1109/PacificVis.2018.00010

Исследование методов расчета матриц рассеяния аналоговых трактов активных фазированных антенных решеток

Autoři: Zaikov, K. D. Anikin, A. S. Yarkov, K. A.

Témata: COMPUTATIONAL COMPLEXITY OF ALGORITHMS, МАТРИЦА РАССЕЯНИЯ, ACTIVE PHASED ARRAY ANTENNA, ПРИЕМОПЕРЕДАТЧИК, ТОЧНОСТЬ АЛГОРИТМОВ, АЛГОРИТМЫ РАСЧЕТА КАСКАДНОГО СОЕДИНЕНИЯ МАТРИЦ РАССЕЯНИЯ, ALGORITHMS FOR CALCULATING THE CASCADE, ВЫЧИСЛИТЕЛЬНАЯ СЛОЖНОСТЬ АЛГОРИТМОВ, АКТИВНАЯ ФАЗИРОВАННАЯ АНТЕННАЯ РЕШЕТКА, TRANSCEIVER, ANALOG PATH, SCATTER MATRIX, АНАЛОГОВЫЙ ТРАКТ, ACCURACY OF ALGORITHMS

Přístupová URL adresa: http://elar.urfu.ru/handle/10995/116322

Methods for calculating scattering matrices of analog path of active phased array antennas ; Исследование методов расчета матриц рассеяния аналоговых трактов активных фазированных антенных решеток

Autoři: Zaikov, K. D. Anikin, A. S. Yarkov, K. A.

Zdroj: URAL RADIO ENGINEERING JOURNAL; Том 6, № 2 (2022): URAL RADIO ENGINEERING JOURNAL ; 2588-0462 ; 2588-0454

Témata: active phased array antenna, transceiver, analog path, scatter matrix, algorithms for calculating the cascade connection of scatter matrices, accuracy of algorithms, computational complexity of algorithms, активная фазированная антенная решетка, приемопередатчик, аналоговый тракт, матрица рассеяния, алгоритмы расчета каскадного соединения матриц рассеяния, точность алгоритмов, вычислительная сложность алгоритмов

Popis souboru: application/pdf

Relation: https://journals.urfu.ru/index.php/urj/article/view/6085/pdf; https://journals.urfu.ru/index.php/urj/article/view/6085

Dostupnost: https://journals.urfu.ru/index.php/urj/article/view/6085

Removing Connected Obstacles in the Plane Is FPT

Autoři: Eiben, Eduard Lokshtanov, Daniel Eduard Eiben and Daniel Lokshtanov

Přispěvatelé: Eiben, Eduard Lokshtanov, Daniel Eduard Eiben and Daniel Lokshtanov

Témata: parameterized complexity and algorithms, planar graphs, motion planning, barrier coverage, barrier resilience, colored path, minimum constraint removal

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.39

Dostupnost: https://doi.org/10.4230/LIPIcs.SoCG.2020.39
https://nbn-resolving.org/urn:nbn:de:0030-drops-121972
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.39

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane

Autoři: D'Emidio, Mattia Di Stefano, Gabriele Frigioni, Daniele a další

Zdroj: Information and Computation

Témata: Mobile robots, Computational complexity, Distributed algorithms, Luminous robots, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0890540118301330
https://dblp.uni-trier.de/db/journals/iandc/iandc263.html#DEmidioSFN18
https://research.unipg.it/handle/11391/1439921
http://www.elsevier.com/inca/publications/store/6/2/2/8/4/4/index.htt
https://hdl.handle.net/11391/1439921
https://doi.org/10.1016/j.ic.2018.09.010
https://hdl.handle.net/11697/126630
https://doi.org/10.1016/j.ic.2018.09.010

On the complexity of barrier resilience for fat regions and bounded ply

Autoři: Korman, Matias Löffler, Maarten Silveira, Rodrigo Ignacio a další

Přispěvatelé: Korman, Matias Löffler, Maarten Silveira, Rodrigo Ignacio a další

Zdroj: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Témata: Teoria dels, Barrier resilience and coverage, Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica, 0211 other engineering and technologies, Matemàtiques i estadística::Matemàtica aplicada a les ciències [Àrees temàtiques de la UPC], Parameterized complexity and algorithms, Nombres, Teoria dels, 0102 computer and information sciences, 02 engineering and technology, Computer science, 68 Computer science::68Q Theory of computing [Classificació AMS], 01 natural sciences, Approximation algorithms, Matemàtiques i estadística::Anàlisi numèrica [Àrees temàtiques de la UPC], Nombres, Classificació AMS::68 Computer science::68Q Theory of computing, Number theory, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències, Informàtica, 11 Number theory::11Y Computational number theory [Classificació AMS], Taverne, Bounded ply, Fat regions, Classificació AMS::11 Number theory::11Y Computational number theory

Popis souboru: application/pdf

Přístupová URL adresa: https://upcommons.upc.edu/bitstream/2117/122214/1/resilience-journal-final.pdf
http://hdl.handle.net/2117/122214
https://tohoku.pure.elsevier.com/en/publications/on-the-complexity-of-barrier-resilience-for-fat-regions-and-bound
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F371811
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=201802226732248006
http://dspace.library.uu.nl/handle/1874/371811
https://doi.org/10.1016/j.comgeo.2018.02.006
https://dblp.uni-trier.de/db/journals/comgeo/comgeo72.html#KormanLSS18
https://dspace.library.uu.nl/handle/1874/371811

Vizualizacija algoritama pretraživanja

Autoři: Držaić, Dino Milišić, Josipa Pina

Přispěvatelé: Držaić, Dino Milišić, Josipa Pina

Témata: složenost algoritma, vizualizacija, graph theory, React, search algorithms, complexity of algorithms, algoritmi pretraživanja, teorija grafova, visualization

Popis souboru: application/pdf

Přístupová URL adresa: https://repozitorij.fer.unizg.hr/islandora/object/fer:12222
https://repozitorij.fer.unizg.hr/islandora/object/fer:12222/datastream/PDF
https://urn.nsk.hr/urn:nbn:hr:168:745320

Реализация метод а экономного кодирования Хаффмана в информационно-телеметрических системах

Témata: Huffman method, сложность алгоритмов, economical coding, метод Хаффмана, сортировка данных, complexity of algorithms, data sorting, экономное кодирование

A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra under Orthogonal Projection on Two-Dimensional Planes

Autoři: Borgwardt, Karl Heinz

Zdroj: Mathematics of Operations Research, 1999 Aug 01. 24(3), 544-603.

Přístupová URL adresa: https://www.jstor.org/stable/3690648

Aplicação e comparação de métodos numéricos na solução de sistemas de equações lineares em problemas de treliças espaciais

Autoři: Luiz Antonio Farani de Souza Rodrigo dos Santos Veloso Martins Juliana Castanon Xavier a další

Zdroj: Semina: Ciências Exatas e Tecnológicas, Vol 39, Iss 1, Pp 49-60 (2018)

Témata: space trusses, positional finite element, complexity of algorithms, conjugate gradient, Technology (General), T1-995, Science (General), Q1-390

Popis souboru: electronic resource

Relation: http://www.uel.br/revistas/uel/index.php/semexatas/article/view/33235; https://doaj.org/toc/1676-5451; https://doaj.org/toc/1679-0375

Přístupová URL adresa: https://doaj.org/article/d111e5b2c83b481b8ed7ec78a82798cb

Comparative analysis of the complexity of the linearization and enumeration methods for solving systems of nonlinear boolean equations ; Сравнительный анализ сложности методов линеа-ризации и перебора решения систем нелинейных булевых уравнений ; Порівняльний аналіз складності методів лінеаризації та перебору розв’язання систем нелінійних булевих рівнянь

Autoři: Лещенко, Владислав Вадимович Пекарчук, Ніна Андріївна Савчук, Михайло Миколайович

Zdroj: Ukrainian Information Security Research Journal; Vol. 22 No. 1 (2020); 33-42 ; Защита информации; Том 22 № 1 (2020); 33-42 ; Захист інформації; Том 22 № 1 (2020); 33-42 ; 2410-7840 ; 2221-5212

Témata: systems of nonlinear Boolean equations, algorithms for solving systems, linearization and enumeration methods, complexity of algorithms, statistical modeling, cryptanalysis, UDC 621.391, 519.2, системы нелинейных случайных булевых уравнений, алгоритмы решения систем, методы линеаризации и полного перебора, сложность алгоритмов, статистическое моделирование, криптоанализ, УДК 621.391, системи нелінійних випадкових булевих рівнянь, алгоритми розв’язку систем, методи лінеаризації та повного перебору, складність алгоритмів, статистичне моделювання, криптоаналіз

Popis souboru: application/pdf

Relation: https://jrnl.nau.edu.ua/index.php/ZI/article/view/14662/21263; https://jrnl.nau.edu.ua/index.php/ZI/article/view/14662/21264; https://jrnl.nau.edu.ua/index.php/ZI/article/view/14662/21265; https://jrnl.nau.edu.ua/index.php/ZI/article/view/14662

Dostupnost: https://jrnl.nau.edu.ua/index.php/ZI/article/view/14662
https://doi.org/10.18372/2410-7840.22.14662

A Parametric Kernel Function Generating the best Known Iteration Bound for Large-Update Methods for CQSDO

Autoři: Loubna, Guerra Mohamed, Achache

Zdroj: Statistics, Optimization & Information Computing; Vol 8 No 4 (2020); 876-889 ; 2310-5070 ; 2311-004X ; 10.19139/soic.v8i4

Témata: Convex quadratic semidefinite optimization, kernel function, interior point methods, large-update algorithms, Complexity of algorithms, 65K05, 90C22, 90C25, 90C51

Popis souboru: application/pdf

Relation: http://www.iapress.org/index.php/soic/article/view/842/695; http://www.iapress.org/index.php/soic/article/view/842

Dostupnost: http://www.iapress.org/index.php/soic/article/view/842
https://doi.org/10.19139/soic-2310-5070-842