Computational complexity theory/Related Articles: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
Pat Palmer (talk | contribs) mNo edit summary |
||
| Line 1: | Line 1: | ||
<noinclude>{{subpages}}</noinclude> | <noinclude>{{subpages}}</noinclude> | ||
{{TOC|right}} | |||
==Parent topics== | ==Parent topics== | ||
| Line 8: | Line 8: | ||
==Other related topics== | ==Other related topics== | ||
{{r|Complexity of algorithms}} | |||
{{r|NP complexity class}} | |||
<!-- Remove the section below after copying links to the other sections. --> | <!-- Remove the section below after copying links to the other sections. --> | ||
| Line 18: | Line 19: | ||
{{r|Big O notation}} | {{r|Big O notation}} | ||
{{r|Brute force attack}} | {{r|Brute force attack}} | ||
{{r|Cryptography}} | {{r|Cryptography}} | ||
{{r|Digital object identifier}} | {{r|Digital object identifier}} | ||
| Line 25: | Line 25: | ||
{{r|MPEG-1}} | {{r|MPEG-1}} | ||
{{r|Mathematics}} | {{r|Mathematics}} | ||
{{r|Operations research}} | {{r|Operations research}} | ||
{{r|Pi (mathematical constant)}} | {{r|Pi (mathematical constant)}} | ||
| Line 31: | Line 30: | ||
{{Bot-created_related_article_subpage}} | {{Bot-created_related_article_subpage}} | ||
<!-- Remove the section above after copying links to the other sections. --> | <!-- Remove the section above after copying links to the other sections. --> | ||
Revision as of 10:09, 6 October 2024
- See also changes related to Computational complexity theory, or pages that link to Computational complexity theory or to this page or whose text contains "Computational complexity theory".
Parent topics
Subtopics
- Complexity of algorithms [r]: How fast the execution time (or memory usage) increases as the data set to be processed grows. [e]
- NP complexity class [r]: Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time. [e]
Bot-suggested topics
Auto-populated based on Special:WhatLinksHere/Computational complexity theory. Needs checking by a human.
- Algorithm [r]: A sequence of steps used to solve a problem. [e]
- Asymmetric key cryptography [r]: A category of cryptographic techniques, which greatly simplify key management, which are based on mathematically related key pairs, such that the "public" key can be used to encrypt and be freely available, and only the holder of the "private" key can decrypt the message [e]
- Big O notation [r]: Mathematical notation to express various upper bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science. [e]
- Brute force attack [r]: An attempt to break a cipher by trying all possible keys; long enough keys make this impractical. [e]
- Cryptography [r]: A field at the intersection of mathematics and computer science that is concerned with the security of information, typically the confidentiality, integrity and authenticity of some message. [e]
- Digital object identifier [r]: Unique label for a computer readable object that can be found on the internet, usually used in academic journals. [e]
- Exponential growth [r]: Increase of a quantity x with time t according to the equation x = Kat, where K and a are constants, a is greater than 1, and K is greater than 0. [e]
- Integrated circuit [r]: Miniaturized electronic circuit that has been manufactured in the surface of a thin substrate of semiconductor material. [e]
- MPEG-1 [r]: One of the earliest practical standards for high quality, low bitrate audio and video compression; includes the MP3 audio format. [e]
- Mathematics [r]: The study of quantities, structures, their relations, and changes thereof. [e]
- Operations research [r]: A set of quantitative techniques for optimum decisionmaking, often with uncertainty, which were first used to solve military operational problems [e]
- Pi (mathematical constant) [r]: Greek letter π and mathematical constant that is approximately equal to 3.14159. [e]