#

Search | Home | Alpha | Brief | Topical | Hierarchical

complexity

Computational complexity class names

Complexity is a LaTeX package that defines commands to typeset Computational Complexity Classes such as $\P$ and $\NP$ (as well as hundreds of others). It also offers several options including which font classes are typeset in and how many are defined (all of them or just the basic, most commonly used ones).

The package has no dependencies other than the standard ifthen package.

The author is Chris Bourke.

License: lppl Version: 0.76 Catalogued: 2005-08-09

- Visit
  - Visit a nearby CTAN:/macros/latex/contrib/complexity. If this fails, try Cambridge.
  - Visit Cambridge:/macros/latex/contrib/complexity
- Download
  - Download from a nearby CTAN (automatically identified).
  - Download from Cambridge.
- Documentation
  - Read documentation for this package from: README.
  - Read documentation for this package from: complexity.pdf.