Mathematical Foundations of Computer Science 2012
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings(Theoretical Computer Science and General Issues)
Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings(Theoretical Computer Science and General Issues)

Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings(Theoretical Computer Science and General Issues)

|
     0     
5
4
3
2
1




International Edition


About the Book

This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Table of Contents:
On the Complexity of Ontological Reasoning under Disjunctive.- Existential Rules.- New Races in Parameterized Algorithmics.- Scott Is Always Simple.- Simple Models for Recursive Schemes.- Unordered Constraint Satisfaction Games.- A Polynomial-Time Algorithm for Computing the Maximum Common.- Subgraph of Outerplanar Graphs of Bounded Degree.- Reductions to the Set of Random Strings: The Resource-Bounded Case.- Approximate Graph Isomorphism.- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.- Generating Functions of Timed Languages.- The Robust Set Problem: Parameterized Complexity and Approximation.- Mortality for 2 × 2 Matrices Is NP-Hard.- Solving Counter Parity Games.- Drawing Planar Graphs on Points Inside a Polygon.- Smoothed Complexity Theory.- Abelian Pattern Avoidance in Partial Words.- The Complexity of Rerouting Shortest Paths.- Computing with Large Populations Using Interactions.- Pancake Flipping Is Hard.- In-place Heap Construction with Optimized Comparisons, Moves, and Cache.- A Dichotomy Theorem for Homomorphism.- On the Impact of Fair Best Response Dynamics.- When Trees Grow Low: Shrubs and Fast MSO1.- Obtaining Planarity by Contracting Few  Kernels for Edge Dominating Set.- Quasi-recognizable vs MSO Definable Languages of One-Dimensional.- Reversal Hierarchies for Small.- The Lower Reaches of Circuit Weakly-Synchronized Ground Tree Rewriting.- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games.- Maximum Cliques in Graphs with Small Intersection Number and Random Intersection.- Regularity Problems for Weak Pushdown ω-Automata and Games.- Computational Aspects of Cellular Automata on Countable Sofic Shifts.- On Two Stronger Versions of Dejean’s Conjecture.- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments.


Best Sellers


Product Details
  • ISBN-13: 9783642325885
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 825
  • Returnable: Y
  • Series Title: 7464 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 3642325882
  • Publisher Date: 21 Jul 2012
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings(Theoretical Computer Science and General Issues)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings(Theoretical Computer Science and General Issues)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!