Function problem: Revision history

Jump to navigation Jump to search
Template:FlatlistExternal tools:

Template:Endflatlist

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. Template:Nowrap from current version, Template:Nowrap from preceding version, Template:Nowrap, Template:Nowrap, Template:Nowrap

17 November 2025

  • curprev 21:3521:35, 17 November 2025 ~2025-34236-95 talk 7,442 bytes +7,442 Deleted problematic/erroneous statement. There is no reason for integer factorization and prime checking to be related here. Integer factorization is not the function class analogue of prime checking (we're computing a composite number). Prime factorization is possibly the the function class analogue of composite checking (the complement of prime checking). It is critical to distinguish between complexity classes and their complements, otherwise, we would regard NP and coNP as the same class.
Retrieved from "https://wiki.sarg.dev/index.php/Function_problem"