pular para conteúdo
Short encodings of evolving structures Ver prévia deste item
FecharVer prévia deste item
Checando...

Short encodings of evolving structures

Autor: Daniel D Sleator; Robert E Tarjan; William P Thurston
Editora: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1991]
Séries: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Edição/Formato   Livro : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:
Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Daniel D Sleator; Robert E Tarjan; William P Thurston
Número OCLC: 25683200
Notas: "December 1991."
Descrição: 26 p. : ill. ; 28 cm.
Título da Série: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Responsabilidade: Daniel D.K. Sleator, Robert E. Tarjan, William P. Thurston.

Resumo:

Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme has a number of diverse applications. It can be used in efficient enumeration of combinatorial objects or for compact representation of program and data structure transformations. It can also be used to derive lower bounds on lengths of derivations.

We show for example that [omega](n log n) applications of the associative and commutative laws are required in the worst case to transform an n-variable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](n log n) 'diagonal flips' are required in the worst case to transform one n-vertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(n log n) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(n log n) upper bound for diagonal flips."

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.

Ítens Similares

Assuntos Relacionados:(1)

Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<http://www.worldcat.org/oclc/25683200>
library:oclcnum"25683200"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/25683200>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:author
schema:contributor
schema:contributor
schema:datePublished"1991"
schema:description"We show for example that [omega](n log n) applications of the associative and commutative laws are required in the worst case to transform an n-variable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](n log n) 'diagonal flips' are required in the worst case to transform one n-vertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(n log n) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(n log n) upper bound for diagonal flips.""
schema:description"Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme has a number of diverse applications. It can be used in efficient enumeration of combinatorial objects or for compact representation of program and data structure transformations. It can also be used to derive lower bounds on lengths of derivations."
schema:exampleOfWork<http://worldcat.org/entity/work/id/26003906>
schema:inLanguage"en"
schema:name"Short encodings of evolving structures"
schema:numberOfPages"26"
schema:publisher
rdf:typeschema:Organization
schema:name"School of Computer Science, Carnegie Mellon University"

Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.