# Category:Structural complexity theory

Computing portal |

Here is a list of articles in the Structural complexity theory category of the Computing portal that unifies foundations of mathematics and computations using computers.

## Pages in category "Structural complexity theory"

The following 17 pages are in this category, out of 17 total.

- Structural complexity theory
*(computing)*

### B

- Berman–Hartmanis conjecture
*(computing)* - Blum axioms
*(computing)*

### C

- Compression theorem
*(computing)*

### I

- Immerman–Szelepcsényi theorem
*(computing)*

### L

- Low and high hierarchies
*(computing)*

### P

- P versus NP problem
*(computing)* - Polynomial creativity
*(computing)* - Polynomial hierarchy
*(computing)*

### R

- Reduction (complexity)
*(computing)* - Resource bounded measure
*(computing)*

### S

- Savitch's theorem
*(computing)* - Sipser–Lautemann theorem
*(computing)* - Space hierarchy theorem
*(computing)*

### T

- Time hierarchy theorem
*(computing)* - Toda's theorem
*(computing)*

### V

- Valiant–Vazirani theorem
*(computing)*