Items related to Extremal Colorings and Extremal Satisfiability: An...
Extremal Colorings and Extremal Satisfiability: An Interplay between Combinatorics and Complexity Theory - Softcover
Combinatorial problems are often easy to state and hard to solve. A whole bunch of graph coloring problems falls into this class as well as the satisfiability problem. The classical coloring problems consider colorings of objects such that two objects which are in a relation receive different colors, e.g., proper vertex-colorings, proper edge-colorings, or proper face-colorings of plane graphs. A generalization is to color the objects such that some predefined patterns are not monochromatic. Ramsey theory deals with questions under what conditions such colorings can occur. A more restrictive version of colorings forces some substructures to be polychromatic, i.e., to receive all colors used in the coloring at least once. Also a true-false-assignment to the boolean variables of a formula can be seen as a 2-coloring of the literals where there are restrictions that complementary literals receive different colors.
"synopsis" may belong to another edition of this title.
About the Author:
Philipp Zumstein did his PhD in theoretical computer science at the Swiss Federal Institute of Technology Zurich (ETH Zurich).
"About this title" may belong to another edition of this title.
- PublisherSuedwestdeutscher Verlag fuer Hochschulschriften
- Publication date2010
- ISBN 10 3838114116
- ISBN 13 9783838114118
- BindingPaperback
- Number of pages140
Buy New
Learn more about this copy
US$ 80.33
Shipping:
US$ 12.41
From United Kingdom to U.S.A.
Top Search Results from the AbeBooks Marketplace
Stock Image
Extremal Colorings and Extremal Satisfiability
Published by
Südwestdeutscher Verlag für Hochschulschriften
(2010)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783838114118_lsuk
Buy New
US$ 80.33
Convert currency
Stock Image
Extremal Colorings and Extremal Satisfiability: An Interplay between Combinatorics and Complexity Theory
Published by
Suedwestdeutscher Verlag fuer Hochschulschriften
(2010)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLING22Oct2817100592021
Buy New
US$ 88.90
Convert currency
Stock Image
Extremal Colorings and Extremal Satisfiability
Published by
Sudwestdeutscher Verlag fur Hochschulschrifte 2010-06
(2010)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
PF
Quantity: 10
Seller:
Rating
Book Description PF. Condition: New. Seller Inventory # 6666-IUK-9783838114118
Buy New
US$ 74.65
Convert currency
Seller Image
Extremal Colorings and Extremal Satisfiability
Published by
Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG Okt 2015
(2015)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
Taschenbuch
Quantity: 2
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Combinatorial problems are often easy to state and hard to solve. A whole bunch of graph coloring problems falls into this class as well as the satisfiability problem. The classical coloring problems consider colorings of objects such that two objects which are in a relation receive different colors, e.g., proper vertex-colorings, proper edge-colorings, or proper face-colorings of plane graphs. A generalization is to color the objects such that some predefined patterns are not monochromatic. Ramsey theory deals with questions under what conditions such colorings can occur. A more restrictive version of colorings forces some substructures to be polychromatic, i.e., to receive all colors used in the coloring at least once. Also a true-false-assignment to the boolean variables of a formula can be seen as a 2-coloring of the literals where there are restrictions that complementary literals receive different colors. 140 pp. Englisch. Seller Inventory # 9783838114118
Buy New
US$ 76.63
Convert currency
Stock Image
Extremal Colorings and Extremal Satisfiability An Interplay between Combinatorics and Complexity Theory
Published by
Suedwestdeutscher Verlag fuer Hochschulschriften
(2010)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
PAP
Quantity: > 20
Seller:
Rating
Book Description PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783838114118
Buy New
US$ 109.80
Convert currency
Seller Image
Extremal Colorings and Extremal Satisfiability : An Interplay between Combinatorics and Complexity Theory
Published by
Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG
(2010)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
Taschenbuch
Quantity: 1
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Combinatorial problems are often easy to state and hard to solve. A whole bunch of graph coloring problems falls into this class as well as the satisfiability problem. The classical coloring problems consider colorings of objects such that two objects which are in a relation receive different colors, e.g., proper vertex-colorings, proper edge-colorings, or proper face-colorings of plane graphs. A generalization is to color the objects such that some predefined patterns are not monochromatic. Ramsey theory deals with questions under what conditions such colorings can occur. A more restrictive version of colorings forces some substructures to be polychromatic, i.e., to receive all colors used in the coloring at least once. Also a true-false-assignment to the boolean variables of a formula can be seen as a 2-coloring of the literals where there are restrictions that complementary literals receive different colors. Seller Inventory # 9783838114118
Buy New
US$ 76.63
Convert currency
Seller Image
Extremal Colorings and Extremal Satisfiability
Published by
Südwestdeutscher Verlag für Hochschulschriften
(2010)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Zumstein PhilippPhilipp Zumstein did his PhD in theoretical computer science atthe Swiss Federal Institute of Technology Zurich (ETH Zurich).Combinatorial problems are often easy to state and hard to solve. A whole bunch of graph. Seller Inventory # 5405782
Buy New
US$ 62.08
Convert currency
Stock Image
Extremal Colorings and Extremal Satisfiability An Interplay between Combinatorics and Complexity Theory
Published by
Suedwestdeutscher Verlag fuer Hochschulschriften
(2010)
ISBN 10: 3838114116
ISBN 13: 9783838114118
New
PAP
Quantity: > 20
Seller:
Rating
Book Description PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783838114118
Buy New
US$ 85.52
Convert currency