FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Language: English

Published by Springer, Springer Dez 2004, 2004

3540240586 / 9783540240587

  • Softcover
  • New
See all details

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

5-star seller

AbeBooks seller since January 23, 2017

View this seller's items
Softcover

Condition: New

£ 47.24

£ 51.45 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - Print on Demand Titel. Neuware -Invited Papers.- Genome Halving Problem Revisited.- Verifying Probabilistic Procedural Programs.- Streaming Algorithms for Geometric Problems.- Toward a Grainless Semantics for Shared-Variable Concurrency.- Regular Languages, Unambiguous Concatenation and Computational Complexity.- Contributed Papers.- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.- On the Urgency Expressiveness.- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages.- A Decidable Fragment of Separation Logic.- Approximate Range Searching Using Binary Space Partitions.- Representable Disjoint NP-Pairs.- Symbolic Reachability Analysis of Higher-Order Context-Free Processes.- Optimal Strategies in Priced Timed Game Automata.- A Calculus for Trust Management.- Short-Cuts on Star, Source and Planar Unfoldings.- Subdividing Alpha Complex.- Real-Counter Automata and Their Decision Problems.- Adjunct Elimination Through Games in Static Ambient Logic.- On the Bisimulation Invariant Fragment of Monadic 1 in the Finite.- On the Complexity of Hilbert's 17th Problem.- Who is Pointing When to Whom .- An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix.- Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.- Minimum Weight Pseudo-Triangulations.- Join Algorithms for the Theory of Uninterpreted Functions.- No, Coreset, No Cry.- Hardness Hypotheses, Derandomization, and Circuit Complexity.- Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract.- Learning Languages from Positive Data and a Finite Number of Queries.- The Complexity of the Local Hamiltonian Problem.-Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds.- Adaptive Stabilization of Reactive Protocols.- Visibly Pushdown Games.- Refinement and Separation Contexts.- Decidability of MSO Theories of Tree Structures.- Distributed Algorithms for Coloring and Domination in Wireless AdHoc Networks.- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size.- Testing Geometric Convexity.- Complexity of Linear Connectivity Problems in Directed Hypergraphs.- Actively Learning to Verify Safety for FIFO Automata.- Reasoning About Game Equilibria Using Temporal Logic.- Alternation in Equational Tree Automata Modulo XOR.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 556 pp. Englisch.

Seller Inventory # 9783540240587

Title
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Author
Kamal Lodaya
Publisher
Springer, Springer Dez 2004
Publication year
2004
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
3540240586
ISBN 13
9783540240587
Item weight
832 grams
Dimensions
235x155x30 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germany

5-star seller

AbeBooks seller since January 23, 2017

Shipping rates from Germany to U.S.A.

Item60 to 60 business days60 to 60 business days
First item£ 51.45£ 64.31
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check
  • Paypal

Store description

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specialty

Modernes Antiquariat - Bücher von 1960 bis heute

Seller's business information

buchversandmimpf2000

Germany