Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Heng
    Last name: Guo
    DBLP: 22/7361
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 19  
    Select a publication
    Show Title Venue Rating Date
    Book chapter
    Heng Guo, Pinyan Lu.
    On the Complexity of Holant Problems.
    The Constraint Satisfaction Problem: Complexity and Approximability 2017, Volume 7 (0) 2017
    Conference paper
    Heng Guo, Kaan Kara, Ce Zhang.
    Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams.
    A Holant Dichotomy: Is the FKT Algorithm Universal?
    IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015 2015 (0) 2015
    Journal article
    Jin-Yi Cai, Heng Guo, Tyson Williams.
    The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Jin-Yi Cai, Heng Guo, Tyson Williams.
    Holographic Algorithms Beyond Matchgates.
    Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 2014 (0) 2014
    Conference paper
    Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda.
    #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain 2014 (0) 2014
    Conference paper
    Jin-Yi Cai, Heng Guo, Tyson Williams.
    The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems.
    55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014 2014 (0) 2014
    Journal article
    Heng Guo, Pinyan Lu, Leslie G. Valiant.
    The Complexity of Symmetric Boolean Parity Holant Problems.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Conference paper
    Jin-Yi Cai, Heng Guo, Tyson Williams.
    A complete dichotomy rises from the capture of vanishing signatures: extended abstract.
    Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013
    Conference paper
    Heng Guo, Tyson Williams.
    The Complexity of Planar Boolean #CSP with Complex Weights.
    Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I 2013 (0) 2013
    Show item 1 to 10 of 19  

    Your query returned 19 matches in the database.