SL (Complexity): Computational Complexity Theory, Complexity Class, Log- Space Reducible, Symmetric Turing Machine - Tapa blanda
Sinopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para SL (Complexity): Computational Complexity Theory, Complexity...
Imagen del vendedor
SL (Complexity)
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131168857
ISBN 13: 9786131168857
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 68 pp. Englisch. Nº de ref. del artículo: 9786131168857
Comprar nuevo
EUR 29,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
SL (Complexity) : Computational Complexity Theory, Complexity Class, Log- Space Reducible, Symmetric Turing Machine
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9786131168857
Comprar nuevo
EUR 31,21
Envío por EUR 60,60
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
SL (Complexity) | Computational Complexity Theory, Complexity Class, Log- Space Reducible, Symmetric Turing Machine
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. SL (Complexity) | Computational Complexity Theory, Complexity Class, Log- Space Reducible, Symmetric Turing Machine | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131168857 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 113279612
Comprar nuevo
EUR 94,40
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
SL (Complexity)
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131168857
ISBN 13: 9786131168857
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computationalcomplexity theory, SL (Symmetric Logspace or Sym-L) is the complexityclass of problems log-space reducible to USTCON (undirected s-tconnectivity), which is the problem of determining whether there existsa path between two vertices in an undirected graph, otherwise describedas the problem of determining whether two vertices are in the sameconnected component. This problem is also called the undirectedreachability problem. It does not matter whether many-one reducibilityor Turing reducibility is used. Although originally described in termsof symmetric Turing machines, that equivalent formulation is verycomplex, and the reducibility definition is what is used in practice.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch. Nº de ref. del artículo: 9786131168857
Comprar nuevo
EUR 116,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles