Abstract
Computational Complexity Questions, such as trying to prove that the NP-complete problem three colorability of graphs (3COLOR) cannot be checked in polynomial time, seemed deceptively simple when I first encountered them as a grad student in the 1970's. So many years later, we still don't even know whether 3COLOR is in the uniform circuit class ACC 0 6 , or equivalently, whether it is expressible in first-order logic with sum mod 6 quantifiers and numeric relations +, *.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
