passa ai contenuti
Short encodings of evolving structures Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

Short encodings of evolving structures

Autore: Daniel D Sleator; Robert E Tarjan; William P Thurston
Editore: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1991]
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Edizione/Formato:   Libro : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:
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
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento: Book
Tutti gli autori / Collaboratori: Daniel D Sleator; Robert E Tarjan; William P Thurston
Numero OCLC: 25683200
Note: "December 1991."
Descrizione: 26 p. : ill. ; 28 cm.
Titolo della serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Responsabilità: Daniel D.K. Sleator, Robert E. Tarjan, William P. Thurston.

Abstract:

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."

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.

Documenti simili

Soggetti correlati:(1)

Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


<http://www.worldcat.org/oclc/25683200>
library:oclcnum"25683200"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/25683200>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
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.""@en
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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/26003906>
schema:inLanguage"en"
schema:name"Short encodings of evolving structures"@en
schema:numberOfPages"26"
schema:publisher
schema:url

Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.