Martin Dyer mainly investigates Combinatorics, Discrete mathematics, Algorithm, Computational complexity theory and Time complexity. Combinatorics is closely attributed to Linear programming in his study. His Line graph, Forbidden graph characterization and Binary logarithm study in the realm of Discrete mathematics interacts with subjects such as Mixing and Chain.
His study in Algorithm is interdisciplinary in nature, drawing from both Regular graph and Peer-to-peer. The Computational complexity theory study combines topics in areas such as Robust optimization, Stochastic programming, Approximation algorithm and Counting problem. Martin Dyer usually deals with Polyhedron and limits it to topics linked to Enumeration and Vertex.
His primary scientific interests are in Combinatorics, Discrete mathematics, Time complexity, Algorithm and Mixing. His work in the fields of Combinatorics, such as Graph, Counting problem and Bipartite graph, overlaps with other areas such as Glauber and Bounded function. As a part of the same scientific family, Martin Dyer mostly works in the field of Bipartite graph, focusing on Unary operation and, on occasion, Binary function and Arity.
The #SAT research Martin Dyer does as part of his general Discrete mathematics study is frequently linked to other disciplines of science, such as Constraint satisfaction problem, therefore creating a link between diverse domains of science. His research on Time complexity often connects related areas such as Homomorphism. Martin Dyer works mostly in the field of Algorithm, limiting it down to topics relating to Mathematical optimization and, in certain cases, Numerical analysis.
Combinatorics, Discrete mathematics, Time complexity, Bipartite graph and Mixing are his primary areas of study. His work on Graph, Vertex and Hypergraph as part of general Combinatorics research is frequently linked to Ergodicity and Chain, thereby connecting diverse disciplines of science. Many of his studies involve connections with topics such as Computational complexity theory and Discrete mathematics.
The study incorporates disciplines such as Numerical analysis and Arithmetic in addition to Computational complexity theory. In his research on the topic of Time complexity, Almost surely and Cubic graph is strongly related with Vertex. His research investigates the link between #SAT and topics such as Complexity class that cross with problems in Decidability.
Martin Dyer focuses on Discrete mathematics, Combinatorics, Mixing, #SAT and Bipartite graph. His Discrete mathematics study frequently links to other fields, such as Computational complexity theory. Martin Dyer combines subjects such as Computation and Binary function with his study of Computational complexity theory.
His Combinatorics research is multidisciplinary, incorporating elements of Order and Constant. In his study, Decidability is inextricably linked to Complexity class, which falls within the broad field of #SAT. While the research belongs to areas of Counting problem, Martin Dyer spends his time largely on the problem of Time complexity, intersecting his research to questions surrounding Elementary proof.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A random polynomial-time algorithm for approximating the volume of convex bodies
Martin Dyer;Alan Frieze;Ravi Kannan.
Journal of the ACM (1991)
Path coupling: A technique for proving rapid mixing in Markov chains
R. Bubley;M. Dyer.
foundations of computer science (1997)
On the complexity of computing the volume of a polyhedron
M. E. Dyer;A. M. Frieze.
SIAM Journal on Computing (1988)
Locating the phase transition in binary constraint satisfaction problems
Barbara M. Smith;Martin E. Dyer.
Artificial Intelligence (1996)
Formulating the single machine sequencing problem with release dates as a mixed integer program
M. E. Dyer;L. A. Wolsey.
Discrete Applied Mathematics (1990)
Computational complexity of stochastic programming problems
Martin Dyer;Leen Stougie.
Mathematical Programming (2006)
The complexity of counting graph homomorphisms
Martin Dyer;Catherine Greenhill.
Random Structures and Algorithms (2000)
Faster random generation of linear extensions
Russ Bubley;Martin Dyer.
Discrete Mathematics (1999)
On the relative complexity of approximate counting problems
Martin E. Dyer;Leslie Ann Goldberg;Catherine S. Greenhill;Mark Jerrum.
Linear Time Algorithms for Two- and Three-Variable Linear Programs
Martin E. Dyer.
SIAM Journal on Computing (1984)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: