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

First-Order Reduction: Computational Problem, Descriptive Complexity Theory, FO (complexity) -

English
2026-03-27
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A first-order reduction is a very weak type of reduction between two computational problems in computational complexity theory. A first-order reduction is a reduction where each component is restricted to be in the class FO of problems calculable in first-order logic. Since we have ... Full description

You May Also Like

Description

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A first-order reduction is a very weak type of reduction between two computational problems in computational complexity theory. A first-order reduction is a reduction where each component is restricted to be in the class FO of problems calculable in first-order logic. Since we have mbox{FO} subsetneq mbox{L}, the first-order reductions are weaker reductions than the logspace reductions. Many important complexity classes are closed under first-order reductions, and many of the traditional complete problems are first-order complete as well (Immerman 1999 p. 49-50). For example, ST-connectivity is FO-complete for NL, and NL is closed under FO reductions (Immerman 1999, p. 51) (as are P, NP, and most other "well-behaved" classes).

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786133234857
Write Your Own Review
You're reviewing: First-Order Reduction: Computational Problem, Descriptive Complexity Theory, FO (complexity)
Your Rating:

Goodreads Reviews

€156.58 €195.73