SL (Complexity)

by Betascript Publishing
State: New
$31.86
VAT included - FREE Shipping
Betascript Publishing SL (Complexity)
Betascript Publishing - SL (Complexity)

Do you like this product? Spread the word!

$31.86 incl. VAT
Only 1 items available Only 1 items available
Delivery: between Wednesday, August 4, 2021 and Friday, August 6, 2021
Sales & Shipping: Dodax EU

Check other buying options

1 Offer for $32.97

Sold by Dodax

$32.97 incl. VAT
State: New
Free Shipping
Delivery: between Wednesday, August 4, 2021 and Friday, August 6, 2021
View other buying options

Description

High Quality Content by WIKIPEDIA articles! In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem of determining whether there exists a path between two vertices in an undirected graph, otherwise described as the problem of determining whether two vertices are in the same connected component. This problem is also called the undirected reachability problem. It does not matter whether many-one reducibility or Turing reducibility is used. Although originally described in terms of symmetric Turing machines, that equivalent formulation is very complex, and the reducibility definition is what is used in practice.

Further information

Language:
English
Number of Pages:
68
Media Type:
Softcover
Publisher:
Betascript Publishing

Master Data

Product Type:
Paperback book
GTIN:
09786131168857
DUIN:
ILV6I44UT5T
$31.86
We use cookies on our website to make our services more efficient and more user-friendly. Therefore please select "Accept cookies"! Please read our Privacy Policy for further information.