Evasive properties of sparse graphs and some linear equations in primes

DOI10.1016/j.tcs.2014.06.005zbMath1420.05092arXiv1304.0188OpenAlexW2963558937MaRDI QIDQ2253204

Igor E. Shparlinski

Publication date: 25 July 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.0188

zbMATH Keywords

evasivenessprime numberssparse graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Miscellaneous applications of number theory (11Z05) Primes in congruence classes (11N13) Distribution of integers with specified multiplicative constraints (11N25) Density (toughness, etc.) (05C42)

Related Items (1)

Elusive properties of infinite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On binary cyclotomic polynomials
• Primes in arithmetic progressions to large moduli. II
• On sums of sequences of integers. II,III
• Primes in arithmetic progressions to large moduli
• Evasiveness and the Distribution of Prime Numbers
• Primes in Arithmetic Progressions to Large Moduli. III
• Shifted primes without large prime factors
• A Lower Bound for the Complexity of Monotone Graph Properties
• On primes in arithmetic progressions

This page was built for publication: Evasive properties of sparse graphs and some linear equations in primes