-
1Academic Journal
المساهمون: Charilaos Efthymiou and Thomas P. Hayes and Daniel Štefankovič and Eric Vigoda
مصطلحات موضوعية: MCMC, Mixing Time, Independent Sets, Hard-Core Model, Approximate Counting Algorithms, Sampling Algorithms
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.33
-
2Academic Journal
المؤلفون: Helmuth, Tyler, Perkins, Will, Regts, Guus
المساهمون: Charikar, Moses, Cohen, Edith
المصدر: Helmuth , T , Perkins , W & Regts , G 2019 , Algorithmic Pirogov-sinai theory . in M Charikar & E Cohen (eds) , STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing . Proceedings of the Annual ACM Symposium on Theory of Computing , Association for Computing Machinery (ACM) , pp. 1009-1020 , 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 , Phoenix , United States , 23/06/19 . https://doi.org/10.1145/3313276.3316305
مصطلحات موضوعية: Approximate counting algorithms, Hard-core model, Pirogov-Sinai theory, Potts model, Sampling algorithms, Statistical physics
وصف الملف: application/pdf
Relation: https://research-information.bris.ac.uk/en/publications/8a952430-cf4a-4cec-80f0-5bf020838070; urn:ISBN:9781450367059
الاتاحة: https://hdl.handle.net/1983/8a952430-cf4a-4cec-80f0-5bf020838070
https://research-information.bris.ac.uk/en/publications/8a952430-cf4a-4cec-80f0-5bf020838070
https://doi.org/10.1145/3313276.3316305
https://research-information.bris.ac.uk/ws/files/209839753/Full_text_PDF_submitted_manuscript_.pdf
http://www.scopus.com/inward/record.url?scp=85068747330&partnerID=8YFLogxK -
3
المؤلفون: Helmuth, T., Perkins, W., Regts, G., Charikar, M., Cohen, E.
المساهمون: Charikar, Moses, Cohen, Edith, Algebra, Geometry & Mathematical Physics (KDV, FNWI)
المصدر: STOC
Helmuth, T, Perkins, W & Regts, G 2019, Algorithmic Pirogov-sinai theory . in M Charikar & E Cohen (eds), STOC 2019-Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing . Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery (ACM), pp. 1009-1020, 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, United States, 23/06/19 . https://doi.org/10.1145/3313276.3316305
Probability Theory and Related Fields, 176(3-4), 851-895. Springer New York
STOC '19: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 1009-1020
STARTPAGE=1009;ENDPAGE=1020;TITLE=STOC '19مصطلحات موضوعية: Statistics and Probability, FOS: Computer and information sciences, Pirogov-Sinai theory, FOS: Physical sciences, 0102 computer and information sciences, 01 natural sciences, Combinatorics, 010104 statistics & probability, symbols.namesake, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Lattice (order), Computer Science - Data Structures and Algorithms, Taylor series, FOS: Mathematics, Mathematics - Combinatorics, Potts model, Data Structures and Algorithms (cs.DS), Boundary value problem, 0101 mathematics, Hard-core model, Mathematical Physics, Mathematics, Discrete mathematics, Mathematical finance, 010102 general mathematics, Probability (math.PR), Sampling algorithms, Approximation algorithm, Torus, Mathematical Physics (math-ph), Approximate counting algorithms, 010201 computation theory & mathematics, symbols, Statistical physics, Combinatorics (math.CO), Statistics, Probability and Uncertainty, Mathematics - Probability, Analysis, Gibbs sampling, Cluster expansion
وصف الملف: application/pdf