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

On the Average Case Complexity of Berge Algorithm

Autoři: Mostafa Gholami Julien David Loick Lhote

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

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

Zdroj: Discrete Applied Mathematics. 345:4-8

Témata: Informatique générale

Minimum average case time complexity for sorting algorithms

Autoři: Anurag Dutta Manan Roy Choudhury Rakesh K. Sharma

Zdroj: Iran Journal of Computer Science. 6:445-451

Average-Case Complexity of Quantum Stabilizer Decoding

Autoři: Khesin, Andrey Boris Lu, Jonathan Z. Poremba, Alexander a další

Témata: FOS: Computer and information sciences, Quantum Physics, Computational Complexity, Data Structures and Algorithms, Cryptography and Security, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC), Quantum Physics (quant-ph), Cryptography and Security (cs.CR)

Přístupová URL adresa: http://arxiv.org/abs/2509.20697

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field

Autoři: Gimenez, Nardo Ariel Matera, Guillermo Pérez, Mariana a další

Zdroj: Combinatorics, Probability and Computing. 31:166-183

Témata: 4. Education, 11T06, 68Q25, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, RATIONAL POINTS, EUCLIDEAN ALGORITHMS, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Combinatorics (math.CO), FINITE FIELDS, SYMMETRIC FUNCTIONS

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/2001.03222
http://arxiv.org/abs/2001.03222
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0963548321000274
http://hdl.handle.net/11336/155301

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

On the average-case complexity of pattern matching with wildcards

Autoři: Carl Barton

Zdroj: Theoretical Computer Science. 922:37-45

Témata: FOS: Computer and information sciences, 0301 basic medicine, Computer Science - Computational Complexity, 03 medical and health sciences, csis, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1407.0950
https://eprints.bbk.ac.uk/id/eprint/48011/2/48011.pdf

A Fast Coloring Oracle for Average Case Hypergraphs

Autoři: Marcussen, Cassandra Pyne, Edward Rubinfeld, Ronitt a další

Přispěvatelé: Marcussen, Cassandra Pyne, Edward Rubinfeld, Ronitt a další

Témata: FOS: Computer and information sciences, average-case algorithms, Computational Complexity, Data Structures and Algorithms, Combinatorics, graph coloring, FOS: Mathematics, local computation algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computational Complexity (cs.CC)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2507.10691
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.61

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

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

Zdroj: Future Generation Computer Systems. 95:743-753

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0167739X18319307
https://doi.org/10.1016/j.future.2019.01.043
http://doi.org/10.1016/j.future.2019.01.043
https://dblp.uni-trier.de/db/journals/fgcs/fgcs95.html#AmrahovMC19
https://avesis.aybu.edu.tr/publication/details/42d0fe26-ff31-4482-bb5b-769d37d637df/oai

Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms

Autoři: Grochow, Joshua A. Qiao, Youming Tang, Gang a další

Přispěvatelé: Grochow, Joshua A. Qiao, Youming Tang, Gang a další

Zdroj: Groups, Complexity, Cryptology, Vol Volume 14, Issue 1 (2022)

Témata: FOS: Computer and information sciences, polynomial isomorphism, average-case algorithms, trilinear form equivalence, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, computer science - data structures and algorithms, Computer Science - Computational Complexity, tensor isomorphism complete, algebra isomorphism, Computer Science - Data Structures and Algorithms, symmetric and alternating bilinear maps, QA1-939, Data Structures and Algorithms (cs.DS), computer science - computational complexity, ddc:004, 0101 mathematics, Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2012.01085
https://doaj.org/article/821a451c6f5047f5836055840bd95dd7
https://dblp.uni-trier.de/db/journals/corr/corr2012.html#abs-2012-01085
https://drops.dagstuhl.de/opus/volltexte/2021/13683/pdf/LIPIcs-STACS-2021-38.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13683/
https://arxiv.org/abs/2012.01085
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.38

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

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

Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms

Autoři: Nicaud, Cyril Pivoteau, Carine Vialette, Stéphane a další

Přispěvatelé: Nicaud, Cyril Pivoteau, Carine Vialette, Stéphane a další

Témata: FOS: Computer and information sciences, Markov chains, Computer Science - Data Structures and Algorithms, transducers, average case complexity, Data Structures and Algorithms (cs.DS), [INFO] Computer Science [cs], ddc:004, branch prediction, Pattern matching

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2503.13694
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.8
https://hal.science/hal-05147509v1
https://doi.org/10.4230/lipics.cpm.2025.8

Polynomial-time Trace Reconstruction in the Smoothed Complexity Model.

Autoři: Chen, Xi De, Anindya Lee, Chin Ho a další

Zdroj: ACM Transactions on Algorithms; Jul2025, Vol. 21 Issue 3, p1-28, 28p

Témata: POLYNOMIAL time algorithms, COMPUTATIONAL complexity, ALGORITHMS

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

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

Přispěvatelé: Cavalar, Bruno P. Lu, Zhenjian Bruno P. Cavalar and Zhenjian Lu

Zdroj: Algorithmica. 85:2131-2155

Témata: FOS: Computer and information sciences, average-case complexity, 0209 industrial biotechnology, TK, 0102 computer and information sciences, 02 engineering and technology, satisfiability algorithms, Computational Complexity (cs.CC), 01 natural sciences, QA76, Computer Science - Computational Complexity, pseudorandom generators, ddc:004, comparator circuits

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2111.14974
http://wrap.warwick.ac.uk/163706/1/WRAP-Algorithms-and-lower-bounds-for-comparator-circuits-from-shrinkage-Cavalar-2022.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.34

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

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

Autoři: Ulrich Meyer

Zdroj: Journal of Algorithms. 48:91-134

Témata: \(\Delta\)-stepping algorithm, Analysis of algorithms and problem complexity, Bellman-Ford algorithm, 0211 other engineering and technologies, Pallottino's incremental graph algorithm, 0102 computer and information sciences, 02 engineering and technology, approximate Bucket implementation, 01 natural sciences, graphs with random edge weights, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), threshold approach, topological ordering SSSP algorithm, Nonnumerical algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://www.mpi-inf.mpg.de/~umeyer/dfg/jalg2003.pdf
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1329992
https://www.sciencedirect.com/science/article/abs/pii/S0196677403000464
https://dl.acm.org/doi/10.1016/S0196-6774%2803%2900046-4
http://www.sciencedirect.com/science/article/pii/S0196677403000464
https://dblp.uni-trier.de/db/journals/jal/jal48.html#Meyer03

Average-case analysis of algorithms using Kolmogorov complexity

Autoři: Jiang, T. Li, M. Vitanyi, P.M.B.

Zdroj: Journal of Computer Science and Technology. 15:402-408

Témata: average-case complexity of algorithms, Kolmogorov complexity, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://ir.cwi.nl/pub/1194/1194D.pdf
https://hdl.handle.net/11245/1.246172
https://dare.uva.nl/personal/pure/en/publications/averagecase-analysis-of-algorithms-using-kolgromov-complexity(eb7397e2-0c93-4f47-b10d-6c7b921612df).html
https://doi.org/10.1007/BF02950402
https://jcst.ict.ac.cn/CN/abstract/abstract681.shtml
https://link.springer.com/article/10.1007%2FBF02950402
https://dblp.uni-trier.de/db/journals/jcst/jcst15.html#JiangLV00
https://www.narcis.nl/publication/RecordID/oai%3Adare.uva.nl%3Apublications%2Feb7397e2-0c93-4f47-b10d-6c7b921612df
http://caod.oriprobe.com/articles/24602036/Average_Case_Analysis_of_Algorithms_Using_Kolmogorov_Complexity.htm
http://doi.org/10.1007/BF02950402

Correction to: Minimum average case time complexity for sorting algorithms

Autoři: Anurag Dutta Manan Roy Choudhury Rakesh K. Sharma

Zdroj: Iran Journal of Computer Science. 6:453-453

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