Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A complexity dichotomy for hypergraph partition functions
An approximation trichotomy for Boolean #CSP
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
Corrigendum: Sampling regular graphs and a peer-to-peer network
Log-supermodular functions, functional clones and counting CSPs
No associations
LandOfFree
Martin Dyer does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Martin Dyer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Martin Dyer will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-170976