Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007711346/catalog> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- catalog abstract "This book constitutes the refereed proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'97, held as a satelite meeting of ICALP'97, in Bologna, Italy, in July 1997. The volume presents 14 thoroughly revised full papers selected from 37 submissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arising in the development of efficient randomized solutions to computationally difficult problems. The papers are organized in sections on approximation, randomness, algorithms, and complexity.".
- catalog alternative "RANDOM '97".
- catalog contributor b10661460.
- catalog contributor b10661461.
- catalog created "c1997.".
- catalog date "1997".
- catalog date "c1997.".
- catalog dateCopyrighted "c1997.".
- catalog description "Includes bibliographical references and index.".
- catalog description "Polynomial time approximation schemes for some dense instances of NP-hard optimization problems / Marek Karpinski -- Average-case complexity of shortest-paths problems in the vertex-potential model / Colin Cooper [and others] -- Approximation algorithms for covering polygons with squares and similar problems / Christos Levcopoulos and Joachim Gudmundsson -- Greedily approximating the r-independent set and k-center problems on random instances / Bernd Kreuter and Till Nierhoff -- Nearly linear time approximation schemes for Euclidean TSP and other geometric problems / Sanjeev Arora --Random sampling of Euler tours / Prasad Tetali and Santosh Vempala -- A combinatorial consistency lemma with application to proving the PCP theorem / Oded Goldreich and Shmuel Safra -- Super-bits, demi-bits, and NP̃/qpoly-natural proofs / Steven Rudich -- Sample spaces with small bias on neighborhoods and error-correcting communication protocols / Michael Saks and Shiyu Zhou -- Approximation on the Web : a compendium of NP optimization problems / Pierluigi Crescenzi and Viggo Kann -- Random-based scheduling : new approximations and LP lower bounds / Andreas S. Schulz and Martin Skutella --'Go with the winners' generators with applications to molecular modeling / Marcus Peinado and Thomas Lengauer -- Probabilistic approximation of some NP optimization problems by finite-state machines / Dawei Hong and Jean-Camille Birget -- Using hard problems to derandomize algorithms : an incomplete survey / Russell Impagliazzo -- Weak and strong recognition by 2-way randomized automata / Andris Ambainis, Rūsiņs̆ Freivalds and Marek Karpinski -- Tally languages accepted by Monte Carlo pushdown automata / Jānis Kaņeps, Dainis Geidmanis and Rūsiņs Freivalds -- Resources-bounded randomness and compressibility with respect to nonuniform measures / Steven M. Kautz -- Randomness, stochasticity, and approximations / Yongge Wang.".
- catalog description "This book constitutes the refereed proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'97, held as a satelite meeting of ICALP'97, in Bologna, Italy, in July 1997. The volume presents 14 thoroughly revised full papers selected from 37 submissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arising in the development of efficient randomized solutions to computationally difficult problems. The papers are organized in sections on approximation, randomness, algorithms, and complexity.".
- catalog extent "viii, 225 p. :".
- catalog identifier "3540632484 (softcover : alk. paper)".
- catalog isPartOf "Lecture notes in computer science ; 1269".
- catalog issued "1997".
- catalog issued "c1997.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "004/.01/5114 21".
- catalog subject "Combinatorics.".
- catalog subject "Computational complexity.".
- catalog subject "Computer science Statistical methods Congresses.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Mathematical optimization.".
- catalog subject "QA76. .R266 1997".
- catalog tableOfContents "Polynomial time approximation schemes for some dense instances of NP-hard optimization problems / Marek Karpinski -- Average-case complexity of shortest-paths problems in the vertex-potential model / Colin Cooper [and others] -- Approximation algorithms for covering polygons with squares and similar problems / Christos Levcopoulos and Joachim Gudmundsson -- Greedily approximating the r-independent set and k-center problems on random instances / Bernd Kreuter and Till Nierhoff -- Nearly linear time approximation schemes for Euclidean TSP and other geometric problems / Sanjeev Arora --Random sampling of Euler tours / Prasad Tetali and Santosh Vempala -- A combinatorial consistency lemma with application to proving the PCP theorem / Oded Goldreich and Shmuel Safra -- Super-bits, demi-bits, and NP̃/qpoly-natural proofs / Steven Rudich -- Sample spaces with small bias on neighborhoods and error-correcting communication protocols / Michael Saks and Shiyu Zhou -- Approximation on the Web : a compendium of NP optimization problems / Pierluigi Crescenzi and Viggo Kann -- Random-based scheduling : new approximations and LP lower bounds / Andreas S. Schulz and Martin Skutella --'Go with the winners' generators with applications to molecular modeling / Marcus Peinado and Thomas Lengauer -- Probabilistic approximation of some NP optimization problems by finite-state machines / Dawei Hong and Jean-Camille Birget -- Using hard problems to derandomize algorithms : an incomplete survey / Russell Impagliazzo -- Weak and strong recognition by 2-way randomized automata / Andris Ambainis, Rūsiņs̆ Freivalds and Marek Karpinski -- Tally languages accepted by Monte Carlo pushdown automata / Jānis Kaņeps, Dainis Geidmanis and Rūsiņs Freivalds -- Resources-bounded randomness and compressibility with respect to nonuniform measures / Steven M. Kautz -- Randomness, stochasticity, and approximations / Yongge Wang.".
- catalog title "RANDOM '97".
- catalog title "Randomization and approximation techniques in computer science : international workshop RANDOM '97, Bologna, Italy, July 11-12,1997 : proceedings / José Rolim, ed.".
- catalog type "Conference proceedings. fast".
- catalog type "text".