20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Sparse Language: Computational Complexity Theory, Formal Language, String (Computer Science), Polynomial, NP (Complexity) -

English
2026-03-20
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! In computational complexity theory, a sparse language is a formal language (a set of strings) such that the number of strings of length n in the language is bounded by a polynomial function of n. They are used primarily in the study of the relationship of the complexity class NP with other classes. The complexity class of all sparse languages is called SPARSE. SPA ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! In computational complexity theory, a sparse language is a formal language (a set of strings) such that the number of strings of length n in the language is bounded by a polynomial function of n. They are used primarily in the study of the relationship of the complexity class NP with other classes. The complexity class of all sparse languages is called SPARSE. SPARSE contains TALLY, the class of unary languages, since these have at most one string of any one length. Although not all languages in P/poly are sparse, there is a polynomial-time Turing reduction from any language in P/poly to a sparse language. Fortune showed in 1979 that if any sparse language is co-NP-complete, then P = NP; Mahaney used this to show in 1982 that if any sparse language is NP-complete, then P = NP (this is Mahaney's theorem). A simpler proof of this based on left-sets was given by Ogihara and Osamu in 1991. EXPTIME ¿ NEXPTIME if and only if there exist sparse languages in NP that are not in P. In 1999, Jin-Yi Cai and D. Sivakumar, building on work by Ogihara, showed that if there exists a sparse P-complete problem, then L = P.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131197499
Write Your Own Review
You're reviewing: Sparse Language: Computational Complexity Theory, Formal Language, String (Computer Science), Polynomial, NP (Complexity)
Your Rating:

Goodreads Reviews

€156.58 €195.73