doorgaan naar inhoud
Short encodings of evolving structures Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

Short encodings of evolving structures

Auteur: Daniel D Sleator; Robert E Tarjan; William P Thurston
Uitgever: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1991]
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Editie/Formaat:   Boek : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Samenvatting:
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
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Soort document: Boek
Alle auteurs / medewerkers: Daniel D Sleator; Robert E Tarjan; William P Thurston
OCLC-nummer: 25683200
Opmerkingen: "December 1991."
Beschrijving: 26 p. : ill. ; 28 cm.
Serietitel: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Verantwoordelijkheid: Daniel D.K. Sleator, Robert E. Tarjan, William P. Thurston.

Fragment:

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

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.

Vergelijkbare items

Verwante onderwerpen:(1)

Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


<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

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.