Výsledky vyhľadávania - "average case algorithms"

A Fast Coloring Oracle for Average Case Hypergraphs

Autori: Marcussen, Cassandra Pyne, Edward Rubinfeld, Ronitt a ďalší

Prispievatelia: Marcussen, Cassandra Pyne, Edward Rubinfeld, Ronitt a ďalší

Predmety: 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 súboru: application/pdf

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

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

Autori: Grochow, Joshua A. Qiao, Youming Tang, Gang a ďalší

Prispievatelia: Grochow, Joshua A. Qiao, Youming Tang, Gang a ďalší

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

Predmety: 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 súboru: application/pdf

Prí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

Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms

Autori: Grochow, Joshua A. Qiao, Youming Tang, Gang a ďalší

Prispievatelia: Grochow, Joshua A. Qiao, Youming Tang, Gang a ďalší

Predmety: polynomial isomorphism, trilinear form equivalence, algebra isomorphism, average-case algorithms, tensor isomorphism complete, symmetric and alternating bilinear maps

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.38

Dostupnosť: https://doi.org/10.4230/LIPIcs.STACS.2021.38
https://nbn-resolving.org/urn:nbn:de:0030-drops-136836
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.38

A Non-myopic Utility Function for Statistical Global Optimization Algorithms: A non-myopic utility function for statistical global optimization algorithms

Autori: Pirooz Vakili S. Streltsov

Zdroj: Journal of Global Optimization. 14:283-298

Predmety: utility functions, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, utility function, average case algorithms, 02 engineering and technology, average-case, Nonconvex programming, global optimization, Utility theory

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1340310
https://doi.org/10.1023/a:1008284229931
https://link.springer.com/content/pdf/10.1023/A:1008284229931.pdf
http://dblp.uni-trier.de/db/journals/jgo/jgo14.html#StreltsovV99
https://link.springer.com/article/10.1023/A:1008284229931
https://dblp.uni-trier.de/db/journals/jgo/jgo14.html#StreltsovV99

Time-Critical Collision Detection Using an Average-Case Approach

Autori: Jan Klein Gabriel Zachmann Heinz Nixdorf a ďalší

Prispievatelia: Jan Klein Gabriel Zachmann Heinz Nixdorf a ďalší

Zdroj: http://www.cg.cs.uni-bonn.de/docs/publications/2003/klein-2003-time-critical.pdf.

Predmety: Virtual Prototyping, Hierarchical Partitioning, Bounding Volume Trees, Hierarchical Data Structures, Probabilistic Analysis, Average-Case Algorithms

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.9893

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.9893
http://www.cg.cs.uni-bonn.de/docs/publications/2003/klein-2003-time-critical.pdf

A stochastic analog to Chebyshev centers and optimal average case algorithms

Autori: Klaus Ritter Erich Novak

Zdroj: Journal of Complexity. 5:60-79

Predmety: Best approximation, Chebyshev systems, Statistics and Probability, Numerical Analysis, Algebra and Number Theory, Control and Optimization, Applied Mathematics, stochastic analogue to Chebyshev centers in a metric space, Probability theory on algebraic and topological structures, 0101 mathematics, optimal average case algorithms, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/4092442
https://doi.org/10.1016/0885-064x(89)90013-7
https://www.sciencedirect.com/science/article/pii/0885064X89900137
https://dblp.uni-trier.de/db/journals/jc/jc5.html#NovakR89

Divide and conquer for linear expected time

Autori: Jon Louis Bentley Michael Ian Shamos

Zdroj: Information Processing Letters. 7:87-91

Predmety: FOS: Computer and information sciences, Designing Fast Algorithms, Analysis of algorithms and problem complexity, 4. Education, Computational Geometry, Convex Null, Worst-Case Time Complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Average-Case Algorithms, Linear programming, 0202 electrical engineering, electronic engineering, information engineering, 89999 Information and Computing Sciences not elsewhere classified, Linear Programming, Divide-And-Conquer Technique, Algorithms in computer science

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3628382
https://doi.org/10.1016/0020-0190(78)90051-0
https://dblp.uni-trier.de/db/journals/ipl/ipl7.html#BentleyS78
https://doi.org/10.1016/0020-0190(78)90051-0
http://repository.cmu.edu/compsci/2290/
https://www.sciencedirect.com/science/article/pii/0020019078900510
http://www.sciencedirect.com/science/article/pii/0020019078900510

ABSTRACT Time-Critical Collision Detection Using an Average-Case Approach

Autori: Jan Klein Heinz Nixdorf The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Jan Klein Heinz Nixdorf The Pennsylvania State University CiteSeerX Archives

Zdroj: http://zach.in.tu-clausthal.de/papers/vrst03_print.pdf.

Predmety: Virtual Prototyping, Hierarchical Partitioning, Bounding Volume Trees, Hierarchical Data Structures, Probabilistic Analysis, Average-Case Algorithms

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.3018

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.3018
http://zach.in.tu-clausthal.de/papers/vrst03_print.pdf

Faster Random k-CNF Satisfiability

Autori: Lincoln, Andrea Yedidia, Adam

Témy: Random k-SAT, Average-Case, Algorithms, Data processing Computer science, InProceedings, publishedVersion