📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Testability and repair of hereditary hypergraph properties (2010)

First Author: Austin T

Attributed to: The Complexity of Counting in Constraint Satisfaction Problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1002/rsa.20300

Publication URI: http://dx.doi.org/10.1002/rsa.20300

Type: Journal Article/Review

Parent Publication: Random Structures & Algorithms

Issue: 4