Jump to content

Bit complexity

From Wikipedia, the free encyclopedia

Redirect page

Redirect to:

Computational complexity#bit complexity

This page is a redirect. The following categories are used to track and monitor this redirect:

From a printworthy page title: This is a redirect from a title that would be helpful in a printed or CD/DVD version of Wikipedia. See Wikipedia:Printability and Version 1.0 Editorial Team for more information.

From a subtopic: This is a redirect from a subtopic of the target article or section.
- If the redirected subtopic could potentially have its own article in the future, then also tag the redirect with {{R with possibilities}} and {{R printworthy}}.

To an embedded anchor: This is a redirect from a topic that does not have its own page to an embedded anchor on the redirect's target page.
- An {{anchor|(anchor name)}} or {{visible anchor}} template, a HTML element with id="(anchor name)", or an |id=(anchor name) parameter might be installed at the beginning of a paragraph, in or near a section header or within a table. The anchor might also be an old section header that has been edited and is anchored within or near the new header to prevent broken internal and external links.
- Even though section headers of the general form ==(Header name)== are themselves a type of anchor, use {{R to section}} instead.

When appropriate, protection levels are automatically sensed, described and categorized.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Bit_complexity&oldid=1027736439"

Hidden categories: