This page (revision-1) was last changed on 29-Nov-2024 16:16 by UnknownAuthor

Only authorized users are allowed to rename pages.

Only authorized users are allowed to delete pages.

Page revision history

Version Date Modified Size Author Changes ... Change note

Page References

Incoming links Outgoing links
Complexity
Complexity

Version management

Difference between version and

At line 1 added 180 lines
!!! Overview
[{$pagename}] is well, complex.
!! [Computational complexity]
Computational complexity works on [classifying|Classification] computational problems according to their inherent difficulty, and relating these classes to each other. A computational problem is a task solved by a [computer]. A computation problem is solvable by mechanical application of mathematical steps, such as an [algorithm].
!! [Communication complexity]
[Communication complexity] works to determine the practical limits on what [computers] can and cannot do. The P versus NP problem, one of the seven Millennium Prize Problems, is dedicated to the field of computational complexity.
!! More Information
There might be more information for this subject on one of the following:
[{ReferringPagesPlugin before='*' after='\n' }]
----
* [#1] - [Computational_complexity_theory|Wikipedia:Computational_complexity_theory|target='_blank'] - based on information obtained 2019-05-03
This page (revision-1) was last changed on 29-Nov-2024 16:16 by UnknownAuthorTop