Výsledky vyhledávání - average-case algorithm complexity~

THE AVERAGE-CASE COMPLEXITY OF COUNTING CLIQUES IN ERDOŐS-REÉNYI HYPERGRAPHS.

Autoři: BOIX-ADSERAÀ, ENRIC BRENNAN, MATTHEW BRESLER, GUY

Zdroj: SIAM Journal on Computing. 2025, Vol. 54 Issue 4, p39-80. 42p.

Témata: *COMPUTATIONAL complexity, *HYPERGRAPHS, *SPARSE graphs, *COMBINATORICS, *TIME complexity, *SUBGRAPHS

Average-case complexity of a branch-and-bound algorithm for Min Dominating Set.

Autoři: Denat, Tom Harutyunyan, Ararat Melissinos, Nikolaos a další

Zdroj: Discrete Applied Mathematics. Mar2024, Vol. 345, p4-8. 5p.

Témata: *DOMINATING set, *ALGORITHMS, *RANDOM graphs, *RANDOM sets, *PHASE transitions, *KNAPSACK problems

Linear average-case complexity of algorithmic problems in groups.

Autoři: Olshanskii, Alexander Shpilrain, Vladimir

Zdroj: Journal of Algebra. Apr2025, Vol. 668, p390-419. 30p.

Témata: *NILPOTENT groups, *SOLVABLE groups, *TIME complexity, *ALGORITHMS

Learning genes from mutated copies: Algorithms and complexity

Autoři: Cavaco, Gonçalo Filipe Rasteiro Ribeiro, João RUN

Přispěvatelé: Cavaco, Gonçalo Filipe Rasteiro Ribeiro, João RUN

Témata: trace reconstruction, genetic algorithms, DNA sequences, Upper bounds, Lower Bounds, Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Popis souboru: application/pdf

Dostupnost: http://hdl.handle.net/10362/182679

Orbit-blocking words and the average-case complexity of Whitehead's problem in the free group of rank 2.

Autoři: Hyde, Lucy O'Connor, Siobhan Shpilrain, Vladimir

Zdroj: Journal of Group Theory. Mar2025, Vol. 28 Issue 2, p423-430. 8p.

Témata: *FREE groups, *COMPUTATIONAL complexity, *PROBLEM solving, *ALGORITHMS

Attacking Pattern Matching Algorithms Based on the Gap between Average-Case and Worst-Case Complexity

Autoři: Cuilan Du Yanbing Liu Aiping Li a další

Zdroj: Journal of Advances in Computer Networks. :228-233

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: http://www.jacn.net/papers/45-N009.pdf
http://www.jacn.net/index.php?m=content&c=index&a=show&catid=30&id=57

On the average-case complexity of pattern matching with wildcards.

Autoři: Barton, Carl¹ (AUTHOR) c.barton@bbk.ac.uk

Zdroj: Theoretical Computer Science. Jun2022, Vol. 922, p37-45. 9p.

Témata: *HUFFMAN codes, *ALGORITHMS

Average Case Subquadratic Exact and Heuristic Procedures for the Traveling Salesman 2-OPT Neighborhood.

Autoři: Lancia, Giuseppe Vidoni, Paolo

Zdroj: INFORMS Journal on Computing. Sep/Oct2025, Vol. 37 Issue 5, p1202-1222. 21p.

Témata: *TRAVELING salesman problem, *HEURISTIC, *DETERMINISTIC algorithms, *GRAPH theory, *COMPUTATIONAL complexity, *EMPIRICAL research

Beating Treewidth for Average-Case Subgraph Isomorphism.

Autoři: Rosenthal, Gregory¹ (AUTHOR) rosenthal@cs.toronto.edu

Zdroj: Algorithmica. Aug2021, Vol. 83 Issue 8, p2521-2551. 31p.

Témata: *CIRCUIT complexity, *ALGORITHMS, *ISOMORPHISM (Mathematics), *GRAPH algorithms

NON-BLACK-BOX WORST-CASE TO AVERAGE-CASE REDUCTIONS WITHIN NP.

Autoři: SHUICHI HIRAHARA¹ s.hirahara@nii.ac.jp

Zdroj: SIAM Journal on Computing. 2023, Vol. 52 Issue 6, p1-34. 34p.

Témata: *KOLMOGOROV complexity, *CIRCUIT complexity, *HARDNESS, *HEURISTIC algorithms

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage.

Autoři: Cavalar, Bruno P. Lu, Zhenjian

Zdroj: Algorithmica. Jul2023, Vol. 85 Issue 7, p2131-2155. 25p.

Témata: *COMPARATOR circuits, *CIRCUIT complexity, *COMPUTABLE functions, *ALGORITHMS

A Simpler Proof Of The Average Case Complexity Of Union-Find WithPath Compression

Přispěvatelé: Otoo, Ekow

Popis souboru: Medium: ED

Přístupová URL adresa: http://www.osti.gov/scitech/servlets/purl/877676

New and improved search algorithms and precise analysis of their average-case complexity.

Autoři: Emrah Amrahov, Şahin Mohammed, Adnan Saher Çelebi, Fatih V.

Zdroj: Future Generation Computer Systems. Jun2019, Vol. 95, p743-753. 11p.

Témata: *SEARCH algorithms

An Average-Case Analysis for a Continuous Random Search Algorithm

Autoři: Pfeifer, Dietmar

Zdroj: Advances in Applied Probability, 1985 Mar 01. 17(1), 231-233.

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

A Lower Bound on the Average-Case Complexity of Shellsort.

Autoři: Jiang, Tao Li, Ming

Zdroj: Journal of the ACM. Sep2000, Vol. 47 Issue 5, p905. 7p.

Témata: *ALGORITHMS, *MATHEMATICAL models, COMPUTATIONAL complexity

Near-Optimal Leader Election in Population Protocols on Graphs.

Autoři: Alistarh, Dan Rybicki, Joel Voitovych, Sasha

Zdroj: Distributed Computing. Sep2025, Vol. 38 Issue 3, p207-245. 39p.

Témata: *GRAPH theory, *COMPUTATIONAL complexity, *DISTRIBUTED algorithms, *STOCHASTIC models, *RANDOM graphs

Average Case Analysis of Brzozowski's Algorithm.

Autoři: Felice, Sven De Nicaud, Cyril

Zdroj: International Journal of Foundations of Computer Science. Feb2016, Vol. 27 Issue 2, p109-126. 18p.

Témata: *ALGORITHMS, *COMPUTATIONAL complexity, *MACHINE theory, *UNIFORM distribution (Probability theory), *POLYNOMIALS

Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms.

Autoři: Itsykson, Dmitry¹ dmitrits@pdmi.ras.ru

Zdroj: Theory of Computing Systems. Feb2014, Vol. 54 Issue 2, p261-276. 16p.

Témata: *MATHEMATICAL bounds, *COMPUTATIONAL complexity, *MATHEMATICAL functions, *ALGORITHMS, *GRAPH theory, *NONLINEAR systems

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

Autoři: Meyer, Ulrich¹ umeyer@mpi-sb.mpg.de

Zdroj: Journal of Algorithms. Aug2003, Vol. 48 Issue 1, p91. 44p.

Témata: *ALGORITHMS, *MATHEMATICAL transformations, *VECTOR topology

Learning algorithms versus automatability of Frege systems.

Autoři: Pich, Ján Santhanam, Rahul

Zdroj: Journal of Mathematical Logic. Dec2024, p1. 35p.

Témata: *MACHINE learning, *CIRCUIT complexity, *BOOLEAN functions, *ARITHMETIC, *INSTRUCTIONAL systems