pular para conteúdo
Theory of algorithms Ver prévia deste item
FecharVer prévia deste item
Checando...

Theory of algorithms

Autor: László Lovász; E Szemerédi
Editora: Amsterdam ; New York : North-Holland ; New York, N.Y. : [Distributors for the U.S.A. and Canada] Elsevier Science Pub. Co., ©1985.
Séries: Colloquia mathematica Societatis János Bolyai, 44.
Edição/Formato   Print book : Publicação de conferência : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Classificação:

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

Assuntos
Mais como este

 

Encontrar uma cópia on-line

Links para este item

Encontrar uma cópia na biblioteca

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

Detalhes

Gênero/Forma: Conference papers and proceedings
Kongress
Congresses
Tipo de Material: Publicação de conferência, Recurso Internet
Tipo de Documento: Livro, Recurso Internet
Todos os Autores / Contribuintes: László Lovász; E Szemerédi
ISBN: 0444877606 9780444877604
Número OCLC: 13985373
Notas: Papers presented at the Colloquium on the Theory of Algorithms held July 16-21, 1984 in Pécs, Hungary.
Descrição: 430 pages : illustrations ; 25 cm.
Conteúdos: On Parallel Algorithms of some Orthogonal Transforms (S.S. Agaian and D.Z. Gevorkian). An Efficient Algorithm for Finding Peripheral Nodes (I. Arany). Computational Aspects of Assigning Characteristic Semigroup of Asynchronous Automata and Their Extensions (S. Bocian and B. Mikolajczak). Reichenbach's Propositional Logic in Algorithmic Form (P. Borowik). The Complexity of Weighted Multi-Constrained Spanning Tree Problems (P. Camerini, G. Galbiati and F. Maffioli). An Algorithm for Finding SC-Preimages of a Deterministic Finite Automaton (K. Chmiel). On Entropy Decomposition Methods and Algorithm Design (Th. Fischer). An Efficient Algorithm for Dynamic String-Storage Allocation (D. Fox). Covering Intervals with Intervals under Containment Constraints (M.R. Garey and R.Y. Pinter). How to Construct Random Functions (O. Goldreich, S. Goldwasser and S. Micali). Four Pebbles Don't Suffice to Search Planar Infinite Labyrinths (F. Hoffmann). Parallel Algorithms: The Impact of Communication Complexity (F. Hossfeld). Tight Worst-Case Bounds for Bin-Packing Algorithms (A. Ivanyi). Hypergraph Planarity and the Complexity of Drawing Venn Diagrams (D.S. Johnson and H.O. Pollak). Convolutional Charaterization of Computability and Complexity of Computations (S. Jukna). Succinct Data Representations and the Complexity of Computations (S. Jukna). Lattices, Basis Reduction and the Shortest Vector Problem (R. Kannan). The Characterization of Some Complexity Classes by Recursion Schemata (M. Liskiewicz, K. Lorys and M. Piotrow). Some Algorithmic Problems on Lattices (L. Lovasz). Linear Proofs in the Non-Negative Cone (J. Moravek). Characterizing Some Low Arithmetic Classes (J.B. Paris, W.G. Handley and A.J. Wilkie). Constructing a Simplex Form of a Rational Matrix (A. Rycerz and J. Jegier). Computing N with a Few Number of Additions (I. Ruzsa and Zs. Tuza). A Hierarchy of Polynomial Time Basis Reduction Algorithms (C.P. Schnorr). A Topological View of Some Problems in Complexity Theory (M. Sipser). v-Computations on Turing Machines and the Accepted Languages (L. Staiger). On the Greedy Algorithm for an Edge-Partitioning Problem (Gy. Turan). The Complexity of Linear Quadtrees (T.R. Walsh).
Título da Série: Colloquia mathematica Societatis János Bolyai, 44.
Responsabilidade: edited by L. Lovász and E. Szemerédi.

Críticas

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

Etiquetas

Seja o primeiro.
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


Primary Entity

<http://www.worldcat.org/oclc/13985373> # Theory of algorithms
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "13985373" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/355772836#Place/amsterdam> ; # Amsterdam
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/355772836#Place/new_york_n_y> ; # New York, N.Y.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/ne> ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/computer_programming> ; # Computer programming
    schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
    schema:about <http://id.worldcat.org/fast/872390> ; # Computer programming
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/theorie_algorithme> ; # théorie algorithme
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/complexite_calcul> ; # complexité calcul
    schema:about <http://id.worldcat.org/fast/1004851> ; # Machine translating
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/algorithms> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/machine_translating> ; # Machine translating
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/parallelisme> ; # parallélisme
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/computabilidade_e_modelos_de_computacao> ; # Computabilidade E Modelos De Computacao
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/algorithmus> ; # Algorithmus
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/informatique_parallele> ; # informatique parallèle
    schema:about <http://dewey.info/class/001.642/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/reseau> ; # réseau
    schema:about <http://experiment.worldcat.org/entity/work/data/355772836#Topic/algorithmentheorie> ; # Algorithmentheorie
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/108138878> ; # László Lovász
    schema:contributor <http://experiment.worldcat.org/entity/work/data/355772836#Meeting/colloquium_on_the_theory_of_algorithms_1984_pecs_hungary> ; # Colloquium on the Theory of Algorithms (1984 : Pécs, Hungary)
    schema:contributor <http://viaf.org/viaf/42471572> ; # E. Szemerédi
    schema:copyrightYear "1985" ;
    schema:datePublished "1985" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/355772836> ;
    schema:genre "Conference publication"@en ;
    schema:genre "Kongress"@en ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0139-3383> ; # Colloquia mathematica Societatis János Bolyai ;
    schema:name "Theory of algorithms"@en ;
    schema:productID "13985373" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/13985373#PublicationEvent/amsterdam_new_york_north_holland_new_york_n_y_distributors_for_the_u_s_a_and_canada_elsevier_science_pub_co_1985> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/355772836#Agent/distributors_for_the_u_s_a_and_canada_elsevier_science_pub_co> ; # [Distributors for the U.S.A. and Canada] Elsevier Science Pub. Co.
    schema:publisher <http://experiment.worldcat.org/entity/work/data/355772836#Agent/north_holland> ; # North-Holland
    schema:url <http://www.gbv.de/dms/hbz/toc/ht002321978.pdf> ;
    schema:workExample <http://worldcat.org/isbn/9780444877604> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/13985373> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Agent/distributors_for_the_u_s_a_and_canada_elsevier_science_pub_co> # [Distributors for the U.S.A. and Canada] Elsevier Science Pub. Co.
    a bgn:Agent ;
    schema:name "[Distributors for the U.S.A. and Canada] Elsevier Science Pub. Co." ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Agent/north_holland> # North-Holland
    a bgn:Agent ;
    schema:name "North-Holland" ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Meeting/colloquium_on_the_theory_of_algorithms_1984_pecs_hungary> # Colloquium on the Theory of Algorithms (1984 : Pécs, Hungary)
    a bgn:Meeting, schema:Event ;
    schema:location <http://experiment.worldcat.org/entity/work/data/355772836#Place/pecs_hungary> ; # Pécs, Hungary)
    schema:name "Colloquium on the Theory of Algorithms (1984 : Pécs, Hungary)" ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Place/new_york_n_y> # New York, N.Y.
    a schema:Place ;
    schema:name "New York, N.Y." ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Place/pecs_hungary> # Pécs, Hungary)
    a schema:Place ;
    schema:name "Pécs, Hungary)" ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Topic/algorithmentheorie> # Algorithmentheorie
    a schema:Intangible ;
    schema:name "Algorithmentheorie"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Topic/complexite_calcul> # complexité calcul
    a schema:Intangible ;
    schema:name "complexité calcul"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Topic/computabilidade_e_modelos_de_computacao> # Computabilidade E Modelos De Computacao
    a schema:Intangible ;
    schema:name "Computabilidade E Modelos De Computacao"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Topic/informatique_parallele> # informatique parallèle
    a schema:Intangible ;
    schema:name "informatique parallèle"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/355772836#Topic/theorie_algorithme> # théorie algorithme
    a schema:Intangible ;
    schema:name "théorie algorithme"@en ;
    .

<http://id.worldcat.org/fast/1004851> # Machine translating
    a schema:Intangible ;
    schema:name "Machine translating"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
    schema:name "Algorithms"@en ;
    .

<http://id.worldcat.org/fast/872390> # Computer programming
    a schema:Intangible ;
    schema:name "Computer programming"@en ;
    .

<http://viaf.org/viaf/108138878> # László Lovász
    a schema:Person ;
    schema:birthDate "1948" ;
    schema:familyName "Lovász" ;
    schema:givenName "László" ;
    schema:name "László Lovász" ;
    .

<http://viaf.org/viaf/42471572> # E. Szemerédi
    a schema:Person ;
    schema:familyName "Szemerédi" ;
    schema:givenName "E." ;
    schema:name "E. Szemerédi" ;
    .

<http://worldcat.org/isbn/9780444877604>
    a schema:ProductModel ;
    schema:isbn "0444877606" ;
    schema:isbn "9780444877604" ;
    .

<http://worldcat.org/issn/0139-3383> # Colloquia mathematica Societatis János Bolyai ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/13985373> ; # Theory of algorithms
    schema:issn "0139-3383" ;
    schema:name "Colloquia mathematica Societatis János Bolyai ;" ;
    schema:name "Colloquia mathematica Societatis János Bolyai," ;
    .

<http://www.worldcat.org/title/-/oclc/13985373#PublicationEvent/amsterdam_new_york_north_holland_new_york_n_y_distributors_for_the_u_s_a_and_canada_elsevier_science_pub_co_1985>
    a schema:PublicationEvent ;
    schema:location <http://experiment.worldcat.org/entity/work/data/355772836#Place/new_york_n_y> ; # New York, N.Y.
    schema:location <http://dbpedia.org/resource/New_York_City> ; # New York
    schema:location <http://experiment.worldcat.org/entity/work/data/355772836#Place/amsterdam> ; # Amsterdam
    schema:organizer <http://experiment.worldcat.org/entity/work/data/355772836#Agent/distributors_for_the_u_s_a_and_canada_elsevier_science_pub_co> ; # [Distributors for the U.S.A. and Canada] Elsevier Science Pub. Co.
    schema:organizer <http://experiment.worldcat.org/entity/work/data/355772836#Agent/north_holland> ; # North-Holland
    .


Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

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