Evasive Properties of Sparse Graphs and Some Linear Equations in Primes
Computational Complexity
2013-04-05 v3 Combinatorics
Number Theory
Abstract
We give an unconditional version of a conditional, on the Extended Riemann Hypothesis, result of L. Babai, A. Banerjee, R. Kulkarni and V. Naik (2010) on the evasiveness of sparse graphs.
Cite
@article{arxiv.1304.0188,
title = {Evasive Properties of Sparse Graphs and Some Linear Equations in Primes},
author = {Igor Shparlinski},
journal= {arXiv preprint arXiv:1304.0188},
year = {2013}
}
Comments
This version corrects a mistake made in the previous version, which was pointed out to the author by Laszlo Babai