Evasiveness and the Distribution of Prime Numbers

DOI10.4230/LIPIcs.STACS.2010.2445zbMath1230.68098OpenAlexW2963198457MaRDI QIDQ3113738

Vipul Naik, Anandam Banerjee, László Babai, Raghav Kulkarni

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_e6a5.html

zbMATH Keywords

extended Riemann hypothesisgraph propertygroup actionevasivenessdecision tree complexityDirichlet primes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Miscellaneous applications of number theory (11Z05) Boolean functions (06E30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Elusive properties of infinite graphs ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Evasive properties of sparse graphs and some linear equations in primes ⋮ Any monotone property of 3-uniform hypergraphs is weakly evasive

This page was built for publication: Evasiveness and the Distribution of Prime Numbers