• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel och pussel

Skapa nya rutiner – hälsoböcker upp till 50% →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Data och IT
    2. Systemvetenskap och AI

    Computer Science - Theory and Applications

    Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings

    AvAnna Frid,Andrei S. Morozov

    Häftad, Engelska, 2009

    Del i serien Lecture Notes in Computer Science

    560 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Beskrivning

    The 4th International Computer Science Symposium in Russia (CSR 2009) was held August 18-23,2009 in Novosibirsk,Russia, hosted by the Sobolev Institute of Mathematics and Novosibirsk State University. It was the fourth event in the series of regular international meetings, following CSR 2006 in St. Petersburg, CSR 2007 in Ekaterinburg, and CSR 2008 in Moscow. The opening lecture was given by Andrei Voronkov, and four other invited plenary lectures were given by Sergei Odintsov, Wolfgang Thomas, Nikolai Vereshchagin, and Hongseok Yang. This volume contains all the accepted papers and some of the abstracts of the invited speakers. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of computer science. We received 66 papers in total, and the Program Committee selected 29. Yandex provided the Best Student Paper Awards; the recepients of these awards were selected by the Program Committee: - Dmitry Itsykson, "Structural complexity of AvgBPP" - Yuri Pritykin and Julya Ulyashkina, "Aperiodicity measure for in?nite sequences." The reviewing processwasorganizedusing the EasyChairconferencesystem, created by Andrei Voronkov.We are grateful to our sponsors: - Russian Foundation for Basic Research - Yandex (the largest Russian Internet portal providing key Web services). We also thank the group of local organizers and in particular Pavel Salimov.

    Produktinformation

    • Utgivningsdatum:2009-07-28
    • Mått:155 x 235 x 21 mm
    • Vikt:581 g
    • Format:Häftad
    • Språk:Engelska
    • Serie:Lecture Notes in Computer Science
    • Antal sidor:369
    • Upplaga:2009
    • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
    • ISBN:9783642033506

    Utforska kategorier

    • Systemvetenskap och AI inom Data och IT

    Innehållsförteckning

    • Invited Papers.- Well-Founded and Partial Stable Semantics Logical Aspects.- The Reachability Problem over Infinite Graphs.- Kolmogorov Complexity and Model Selection.- Automatic Verification of Heap-Manipulating Programs Using Separation Logic.- Accepted Papers.- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism.- Integrality Property in Preemptive Parallel Machine Scheduling.- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.- k-SAT Is No Harder Than Decision-Unique-k-SAT.- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.- Approximability Distance in the Space of H-Colourability Problems.- On Random Ordering Constraints.- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates.- A Feebly Secure Trapdoor Function.- Partitioning Graphs into Connected Parts.- Structural Complexity of AvgBPP.- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.- One-Nonterminal Conjunctive Grammars over a Unary Alphabet.- Concatenation of Regular Languages and Descriptional Complexity.- Approximability of the Maximum Solution Problem for Certain Families of Algebras.- Complete Complexity Classification of Short Shop Scheduling.- Compressed Word Problems in HNN-Extensions and Amalgamated Products.- Variations on Muchnik’s Conditional Complexity Theorem.- An Optimal Bloom Filter Replacement Based on Matrix Solving.- Aperiodicity Measure for Infinite Sequences.- On the Complexity of Matroid Isomorphism Problems.- Breaking Anonymity byLearning a Unique Minimum Hitting Set.- The Budgeted Unique Coverage Problem and Color-Coding.- Formal Verification of Gate-Level Computer Systems.- On Models of a Nondeterministic Computation.- New Plain-Exponential Time Classes for Graph Homomorphism.- Languages Recognized with Unbounded Error by Quantum Finite Automata.
    Hoppa över listan

    Du kanske också är intresserad av

    Klaus W. Wagner, Andrey Rybalchenko, Andrei S. Morozov, Anna Frid - Computer Science - Theory and Applications, E-bok

    Computer Science - Theory and Applications

    Klaus W. Wagner, Andrey Rybalchenko, Andrei S. Morozov, Anna Frid

    E-bok
    2009

    732 kr

    Robert Mercas, Anna Frid - Combinatorics on Words, E-bok

    Combinatorics on Words

    Robert Mercas, Anna Frid

    E-bok
    2023

    1 105 kr

    Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner - STACS 94, Häftad

    STACS 94

    Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner

    Häftad, 1994

    560 kr

    Patrice Enjalbert, Alain Finkel, Klaus W. Wagner - STACS 93, Häftad

    STACS 93

    Patrice Enjalbert, Alain Finkel, Klaus W. Wagner

    Häftad, 1993

    1 113 kr

    Anna Frid, Robert Mercaş - Combinatorics on Words, Häftad
    Del 13899

    Combinatorics on Words

    Anna Frid, Robert Mercaş

    Häftad, 2023

    866 kr

    Anna Frid, Robert Mercas - Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023, Proceedings, Övrigt

    Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023, Proceedings

    Anna Frid, Robert Mercas

    665 kr

    Klaus W. Wagner - Theoretische Informatik, E-bok

    Theoretische Informatik

    Klaus W. Wagner

    E-bok
    2013

    347 kr

    Klaus W. Wagner - Theoretische Informatik, Häftad

    Theoretische Informatik

    Klaus W. Wagner

    Häftad, 2003

    338 kr

    Viktor Kuncak, Andrey Rybalchenko - Verification, Model Checking, and Abstract Interpretation, Häftad

    Verification, Model Checking, and Abstract Interpretation

    Viktor Kuncak, Andrey Rybalchenko

    Häftad, 2012

    560 kr

    Ernie Cohen, Andrey Rybalchenko - Verified Software: Theorie, Tools, Experiments, Häftad

    Verified Software: Theorie, Tools, Experiments

    Ernie Cohen, Andrey Rybalchenko

    Häftad, 2014

    560 kr