📣 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.

On the complexity of finding and counting solution-free sets of integers (2018)

First Author: Meeks K

Attributed to: Independence in groups, graphs and the integers funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.dam.2018.02.008

Publication URI: http://dx.doi.org/10.1016/j.dam.2018.02.008

Type: Journal Article/Review

Parent Publication: Discrete Applied Mathematics