Abstract
The Pattern Recognition (P.R.) problem of the identification of an object from a representation data may be termed as a reduction in the complexity of the representation. Pattern recognizers have to find algorithms which escape the untractability of combinatorial explosion, without being defeated by errors. Thus the recent results obtained in the field of computational complexity are of interest to P.R.. An overview is given, with an attention to the class of NP-complete problems, and polynomial problems of interest to P.R.; some hints are given how to escape untractability.
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.
