Name: Applied Combinatorics
SKU: 125842037
Price: 303840 KRW
Availability: InStock
Author: Roberts
ISBN: 9781032816524

카트

이미지 검색을 사용해 보세요

검색창 이전화면 이전화면

최근 검색어: 전체삭제

인기 검색어

닫기

사이즈비교 공유하기

소득공제 수입

Discrete Mathematics and Its Applications

직수입양서 Applied Combinatorics

Hardback, 3rd Edition

바인딩/에디션 안내

Roberts, Fred / Tesman, Barry

CRC Press 2024.09.04.

회원리뷰 첫번째 리뷰어가 되어주세요

직수입외서는 변심/착오로 인해 주문을 취소할 경우 해외주문 취소수수료 20%가 부과됩니다.?

가격: 337,600원

10 303,840

YES포인트?: 15,200원 (5%) 마니아추가적립

5만원 이상 구매 시 2천원 추가 적립

앱 다운 시 1천원 상품권

결제혜택: 최대 2,000원 즉시할인

이미 소장하고 있다면 판매해 보세요.

예스24에 팔기 바이백 신청 불가 내 가게에서 팔기

국내배송만 가능
해외 거래처 사정에 의하여 품절/지연 가능
도서 정보 중 미표기 사항 안내?
문화비소득공제 가능

시리즈 태그 업체 공지사항 중고직수입양서 소개 구성 소개 특별 구성 MD 한마디 카드뉴스 상세 이미지 책소개 관련 동영상 목차 저자 소개 관련분류 품목정보 만든이 코멘트 예스24 리뷰 책 속으로 줄거리 캐스팅 관련 자료 부가 영상 출판사 리뷰 전문가 리뷰 추천평

펼치기/닫기

Discrete Mathematics and Its Applications

Weakened Ramsey Theory

10% 260,120원

Weakened Ramsey Theory 이동
Handbook of Combinatorial Algebraic Geometry

10% 541,120원

Handbook of Combinatorial Algebraic Geometry 이동
Introduction to Enumerative and Analytic Combinatorics

10% 216,420원

Introduction to Enumerative and Analytic Combinatorics 이동
Discrete Mathematics

10% 364,210원

Discrete Mathematics 이동
Discrete Mathematics

10% 110,270원

Discrete Mathematics 이동
Secret History

10% 116,520원

Secret History 이동
Proof Theory

10% 131,090원

Proof Theory 이동
Introduction to Mathematical Logic

10% 131,090원

Introduction to Mathematical Logic 이동
Introduction to Enumerative and Analytic Combinatorics

10% 118,600원

Introduction to Enumerative and Analytic Combinatorics 이동
Introduction to Cryptography with Open-Source Software

10% 104,040원

Introduction to Cryptography with Open-Source Software 이동
Introduction to Cryptography with Mathematical Foundations and Computer Implementations

10% 131,090원

Introduction to Cryptography with Mathematical Foundations and Computer Implementations 이동
Handbook of Geometric Constraint Systems Principles

10% 347,540원

Handbook of Geometric Constraint Systems Principles 이동
Handbook of Finite Fields

10% 303,840원

Handbook of Finite Fields 이동
Handbook of Enumerative Combinatorics

10% 324,640원

Handbook of Enumerative Combinatorics 이동
Finite-Dimensional Linear Algebra

10% 131,090원

Finite-Dimensional Linear Algebra 이동
Combinatory Logic

10% 131,090원

Combinatory Logic 이동
Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs

10% 129,010원

Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs 이동
Algebraic Number Theory

10% 129,010원

Algebraic Number Theory 이동
50 years of Combinatorics, Graph Theory, and Computing

10% 129,010원

50 years of Combinatorics, Graph Theory, and Computing 이동
Applied Combinatorics

10% 303,840원

Applied Combinatorics 이동
Lambert W Function

10% 131,090원

Lambert W Function 이동
Fundamentals of Ramsey Theory

10% 131,090원

Fundamentals of Ramsey Theory 이동
Combinatorics of Permutations

10% 131,090원

Combinatorics of Permutations 이동
Methods for the Summation of Series

10% 137,340원

Methods for the Summation of Series 이동
Topics in Graph Theory

10% 216,420원

Topics in Graph Theory 이동
Combinatorics and Number Theory of Counting Sequences

10% 106,110원

Combinatorics and Number Theory of Counting Sequences 이동
Combinatorics

10% 108,190원

Combinatorics 이동
Art of Proving Binomial Identities

10% 108,190원

Art of Proving Binomial Identities 이동
Graphs, Algorithms, and Optimization

10% 104,040원

Graphs, Algorithms, and Optimization 이동
Analytic Combinatorics

10% 108,190원

Analytic Combinatorics 이동
더보기

책소개

The original goal in writing this book was to introduce the reader to the tools of combinatorics from an applied point of view. This third edition of Applied Combinatorics was substantially rewritten. There are many new exercises. Additionally, references throughout the book have been updated both in terms of new editions of previously referenced works, as well as with references to recently published books and articles. As the first edition appeared decades prior, the diction in the exposition has been updated and is more contemporary. The book continues to be based on the authors’ philosophy the best way to learn mathematics is through problem solving. Combinatorics can be a wonderful mechanism for introducing students to proofs. The authors treat proofs as rather informal while many of the harder proofs in the book are optional. In this new edition, many new examples and exercises appear, as well as an overall updating of the exposition for more contemporary diction. The book is divided into four parts.The first part introduces the basic tools of combinatorics and their applications. The remaining three parts are organizedaroundthe three basic problems of combinatorics: thecountingproblem,theexistenceproblem,andtheoptimizationproblem.Then Part IV ends with a discussion of optimizationproblemsforgraphsandnetworks. Entire sections focus on applications as switching functions, the use of enzymes to uncover unknown RNA chains, searching and sorting problems of information retrieval, construction of error-correcting codes, counting of chemical compounds, calculation of power in voting situations, and uses of Fibonacci numbers. There are entire sections on applications of recurrences involving convolutions, applications of Eulerian chains, and applications of generating functions. Most of the book is written for a first course on the topic at the undergraduate level. At a fast pace, there is more than enough material for a challenging graduate course. This book first appeared when courses on combinatorics were rare. It is one of the classics that, through its use, helped to establish a viable course in many mathematics departments throughout the world. It remains a useful tool for instructors and students alike.

책소개 더보기펼치기

Chapter 1: What Is Combinatorics? THE BASIC TOOLS OF COMBINATORICS Chapter 2: Basic Counting Rules; Chapter 3: Introduction to Graph Theory; Chapter 4 Relations; THE COUNTING PROBLEM Chapter 5: Generating Functions and Their Applications; Chapter 6: Recurrence Relations; Chapter 7: The Principle of Inclusion and Exclusion; Chapter 8: The Polya Theory of Counting; THE EXISTENCE PROBLEM Chapter 9: Combinatorial Designs; Chapter 10: Coding Theory; Chapter 11: Existence Problems in Graph Theory; COMBINATORIAL OPTIMIZATION Chapter 12: Matching and Covering; Chapter 13: Optimization Problems for Graphs and Networks; Appendix: Answers to Selected Exercises; Author Index; Subject Index; References appear at the end of each chapter.

목차 더보기펼치기

품목정보

발행일: 2024년 09월 04일

쪽수, 무게, 크기: 600쪽 | 1560g | 180*250mm

ISBN13: 9781032816524

리뷰/한줄평0

리뷰

첫번째 리뷰어가 되어주세요.

리뷰 쓰기

혜택 및 유의사항

한줄평

첫번째 한줄평을 남겨주세요.

한줄평 쓰기

혜택 및 유의사항

상품정보안내

직수입외서의 경우, 해외거래처에서 제공하는 정보가 부족하여 제목, 표지, 가격, 유통상태 등의 정보가 미비하거나 변경되는 경우가 있습니다. 정확한 확인을 원하시는 경우, 일대일 상담으로 문의하여 주시면 답변 드리겠습니다.
(판형과 판수 등이 다양한 도서는 찾으시는 도서의 ISBN을 알려 주시면 보다 빠르고 정확한 안내가 가능합니다.)

해외거래처에서 품절인 경우, 2차 거래선을 통해 유럽과 미국 출판사로 직접 수입이 진행될 수 있습니다.
수입 진행 시점으로 부터 2~3주가 추가로 소요되며, 해외에서도 유통이 원활하지 않은 도서는 품절 안내가 지연될 수 있습니다.
해당 경우, 문자와 메일로 별도 안내를 드리고 있사오니 마이페이지에서 휴대전화번호와 메일주소를 다시 한번 확인해주시기 바랍니다.