计算复杂性

计算复杂性
分享
扫描下方二维码分享到微信
打开微信,点击右上角”+“,
使用”扫一扫“即可将网页分享到朋友圈。
作者: [以色列]
2010-04
版次: 1
ISBN: 9787115224002
定价: 99.00
装帧: 平装
开本: 16开
纸张: 胶版纸
页数: 603页
字数: 754千字
正文语种: 英语
原版书名: Computational Complexity: A Conceptual Perspective
13人买过
  •   复杂性理论是计算机科学的理论基础的核心。本书是著名计算机科学家OdedGoldreich的力作,书中对计算任务固有复杂性研究进行了概念性介绍,全面分析了复杂性理论的现代主题。
      本书涉及复杂性理论的很多子领域(如难度放大、伪随机性及概率证明系统等),涵盖了NP完整性、空间复杂性、随机性和计数、伪随机数生成器等内容,还在附录里面介绍了现代密码学基础等。
      本书内容严谨,可读性强,适合作为高年级本科生、研究生的教材。同时,书中展示了复杂性理论的很多子领域,也适合领域专家参考。   OdedGoldreich,以色列魏茨曼科学研究院(WeizmannInstituteofScience)计算机科学教授,MeyerW.Weisgal讲席教授。他是SIAMJournalonComputing、JournalofCryptology和ComputationalComplexity杂志的特约编辑。其主要研究方向是计算复杂性、随机性与计算以及密码学,他在这几个方面均有享誉世界的研究成果。作为一名活跃的学者,他发表了大量的论文,还著有两卷本的FoundationsofCryptography(《密码学基础》)和ModernCryptography,ProbabilisticProofsandPseudorandomness等专著。 1IntroductionandPreliminaries1
    1.1Introduction1
    1.1.1ABriefOverviewofComplexityTheory2
    1.1.2CharacteristicsofComplexityTheory6
    1.1.3ContentsofThisBook8
    1.1.4ApproachandStyleofThisBook12
    1.1.5StandardNotationsandOtherConventions16
    1.2ComputationalTasksandModels17
    1.2.1Representation18
    1.2.2ComputationalTasks18
    1.2.3UniformModels(Algorithms)20
    1.2.4Non-uniformModels(CircuitsandAdvice)36
    1.2.5ComplexityClasses42
    ChapterNotes43

    2P,NP,andNP-Completeness44
    2.1ThePVersusNPQuestion46
    2.1.1TheSearchVersion:FindingVersusChecking47
    2.1.2TheDecisionVersion:ProvingVersusVerifying50
    2.1.3EquivalenceoftheTwoFormulations54
    2.1.4TwoTechnicalCommentsRegardingNP55
    2.1.5TheTraditionalDefinitionofNP55
    2.1.6InSupportofPDifferentfromNP57
    2.1.7PhilosophicalMeditations58
    2.2Polynomial-TimeReductions58
    2.2.1TheGeneralNotionofaReduction59
    2.2.2ReducingOptimizationProblemstoSearchProblems61
    2.2.3Self-ReducibilityofSearchProblems63
    2.2.4DigestandGeneralPerspective67
    2.3NP-Completeness67
    2.3.1Definitions68
    2.3.2TheExistenceofNP-CompleteProblems69
    2.3.3SomeNaturalNP-CompleteProblems71
    2.3.4NPSetsThatAreNeitherinPnorNP-Complete81
    2.3.5ReflectionsonCompleteProblems85
    2.4ThreeRelativelyAdvancedTopics87
    2.4.1PromiseProblems87
    2.4.2OptimalSearchAlgorithmsforNP92
    2.4.3TheClasscoNPandItsIntersectionwithNP94
    ChapterNotes97
    Exercises99

    3VariationsonPandNP108
    3.1Non-uniformPolynomialTime(P/poly)108
    3.1.1BooleanCircuits109
    3.1.2MachinesThatTakeAdvice111
    3.2ThePolynomial-TimeHierarchy(PH)113
    3.2.1AlternationofQuantifiers114
    3.2.2Non-deterministicOracleMachines117
    3.2.3TheP/polyVersusNPQuestionandPH119
    ChapterNotes121
    Exercises122

    4MoreResources,MorePower127
    4.1Non-uniformComplexityHierarchies128
    4.2TimeHierarchiesandGaps129
    4.2.1TimeHierarchies129
    4.2.2TimeGapsandSpeedup136
    4.3SpaceHierarchiesandGaps139
    ChapterNotes139
    Exercises140

    5SpaceComplexity143
    5.1GeneralPreliminariesandIssues144
    5.1.1ImportantConventions144
    5.1.2OntheMinimalAmountofUsefulComputationSpace145
    5.1.3TimeVersusSpace146
    5.1.4CircuitEvaluation153
    5.2LogarithmicSpace153
    5.2.1TheClassL154
    5.2.2Log-SpaceReductions154
    5.2.3Log-SpaceUniformityandStrongerNotions155
    5.2.4UndirectedConnectivity155
    5.3Non-deterministicSpaceComplexity162
    5.3.1TwoModels162
    5.3.2NLandDirectedConnectivity164
    5.3.3ARetrospectiveDiscussion171
    5.4PSPACEandGames172
    ChapterNotes175
    Exercises175

    6RandomnessandCounting184
    6.1ProbabilisticPolynomialTime185
    6.1.1BasicModelingIssues186
    6.1.2Two-SidedError:TheComplexityClassBPP189
    6.1.3One-SidedError:TheComplexityClassesRPandcoRP193
    6.1.4Zero-SidedError:TheComplexityClassZPP199
    6.1.5RandomizedLog-Space199
    6.2Counting202
    6.2.1ExactCounting202
    6.2.2ApproximateCounting211
    6.2.3SearchingforUniqueSolutions217
    6.2.4UniformGenerationofSolutions220
    ChapterNotes227
    Exercises230

    7TheBrightSideofHardness241
    7.1One-WayFunctions242
    7.1.1GeneratingHardInstancesandOne-WayFunctions243
    7.1.2AmplificationofWeakOne-WayFunctions245
    7.1.3Hard-CorePredicates250
    7.1.4ReflectionsonHardnessAmplification255
    7.2HardProblemsinE255
    7.2.1AmplificationwithRespecttoPolynomial-SizeCircuits257
    7.2.2AmplificationwithRespecttoExponential-SizeCircuits270
    ChapterNotes277
    Exercises278

    8PseudorandomGenerators284
    Introduction285
    8.1TheGeneralParadigm288
    8.2General-PurposePseudorandomGenerators290
    8.2.1TheBasicDefinition291
    8.2.2TheArchetypicalApplication292
    8.2.3ComputationalIndistinguishability295
    8.2.4AmplifyingtheStretchFunction299
    8.2.5Constructions301
    8.2.6Non-uniformlyStrongPseudorandomGenerators304
    8.2.7StrongerNotionsandConceptualReflections305
    8.3DerandomizationofTime-ComplexityClasses307
    8.3.1DefiningCanonicalDerandomizers308
    8.3.2ConstructingCanonicalDerandomizers310
    8.3.3TechnicalVariationsandConceptualReflections313
    8.4Space-BoundedDistinguishers315
    8.4.1DefinitionalIssues316
    8.4.2TwoConstructions318
    8.5Special-PurposeGenerators325
    8.5.1PairwiseIndependenceGenerators326
    8.5.2Small-BiasGenerators329
    8.5.3RandomWalksonExpanders332
    ChapterNotes334
    Exercises337

    9ProbabilisticProofSystems349
    9.1InteractiveProofSystems352
    9.1.1MotivationandPerspective352
    9.1.2Definition354
    9.1.3ThePowerofInteractiveProofs357
    9.1.4VariantsandFinerStructure:AnOverview363
    9.1.5OnComputationallyBoundedProvers:AnOverview366
    9.2Zero-KnowledgeProofSystems368
    9.2.1DefinitionalIssues369
    9.2.2ThePowerofZero-Knowledge372
    9.2.3ProofsofKnowledge-AParentheticalSubsection378
    9.3ProbabilisticallyCheckableProofSystems380
    9.3.1Definition381
    9.3.2ThePowerofProbabilisticallyCheckableProofs383
    9.3.3PCPandApproximation398
    9.3.4MoreonPCPItself:AnOverview401
    ChapterNotes404
    Exercises406

    10RelaxingtheRequirements416
    10.1Approximation417
    10.1.1SearchorOptimization418
    10.1.2DecisionorPropertyTesting423
    10.2Average-CaseComplexity428
    10.2.1TheBasicTheory430
    10.2.2Ramifications442
    ChapterNotes451
    Exercises453

    Epilogue461
    AppendixA:GlossaryofComplexityClasses463
    A.1Preliminaries463
    A.2Algorithm-BasedClasses464
    A.2.1TimeComplexityClasses464
    A.2.2SpaceComplexityClasses467
    A.3Circuit-BasedClasses467

    AppendixB:OntheQuestforLowerBounds469
    B.1Preliminaries469
    B.2BooleanCircuitComplexity471
    B.2.1BasicResultsandQuestions472
    B.2.2MonotoneCircuits473
    B.2.3Bounded-DepthCircuits473
    B.2.4FormulaSize474
    B.3ArithmeticCircuits475
    B.3.1UnivariatePolynomials476
    B.3.2MultivariatePolynomials476
    B.4ProofComplexity478
    B.4.1LogicalProofSystems480
    B.4.2AlgebraicProofSystems480
    B.4.3GeometricProofSystems481

    AppendixC:OntheFoundationsofModernCryptography482
    C.1IntroductionandPreliminaries482
    C.1.1TheUnderlyingPrinciples483
    C.1.2TheComputationalModel485
    C.1.3OrganizationandBeyond486
    C.2ComputationalDifficulty487
    C.2.1One-WayFunctions487
    C.2.2Hard-CorePredicates489
    C.3Pseudorandomness490
    C.3.1ComputationalIndistinguishability490
    C.3.2PseudorandomGenerators491
    C.3.3PseudorandomFunctions492
    C.4Zero-Knowledge494
    C.4.1TheSimulationParadigm494
    C.4.2TheActualDefinition494
    C.4.3AGeneralResultandaGenericApplication495
    C.4.4DefinitionalVariationsandRelatedNotions497
    C.5EncryptionSchemes500
    C.5.1Definitions502
    C.5.2Constructions504
    C.5.3BeyondEavesdroppingSecurity505
    C.6SignaturesandMessageAuthentication507
    C.6.1Definitions508
    C.6.2Constructions509
    C.7GeneralCryptographicProtocols511
    C.7.1TheDefinitionalApproachandSomeModels512
    C.7.2SomeKnownResults517
    C.7.3ConstructionParadigmsandTwoSimpleProtocols517
    C.7.4ConcludingRemarks522

    AppendixD:ProbabilisticPreliminariesandAdvancedTopicsinRandomization523
    D.1ProbabilisticPreliminaries523
    D.1.1NotationalConventions523
    D.1.2ThreeInequalities524
    D.2Hashing528
    D.2.1Definitions528
    D.2.2Constructions529
    D.2.3TheLeftoverHashLemma529
    D.3Sampling533
    D.3.1FormalSetting533
    D.3.2KnownResults534
    D.3.3Hitters535
    D.4RandomnessExtractors536
    D.4.1DefinitionsandVariousPerspectives537
    D.4.2Constructions541
    AppendixE:ExplicitConstructions545
    E.1Error-CorrectingCodes546
    E.1.1BasicNotions546
    E.1.2AFewPopularCodes547
    E.1.3TwoAdditionalComputationalProblems551
    E.1.4AList-DecodingBound553
    E.2ExpanderGraphs554
    E.2.1DefinitionsandProperties555
    E.2.2Constructions561
    AppendixF:SomeOmittedProofs566
    F.1ProvingThatPHReducesto#P566
    F.2ProvingThatIP(f)?AM(O(f))?AM(f)572
    F.2.1EmulatingGeneralInteractiveProofsbyAM-Games572
    F.2.2LinearSpeedupforAM578
    AppendixG:SomeComputationalProblems583
    G.1Graphs583
    G.2BooleanFormulae585
    G.3FiniteFields,Polynomials,andVectorSpaces586
    G.4TheDeterminantandthePermanent587
    G.5PrimesandCompositeNumbers587
    Bibliography589
    Index601
  • 内容简介:
      复杂性理论是计算机科学的理论基础的核心。本书是著名计算机科学家OdedGoldreich的力作,书中对计算任务固有复杂性研究进行了概念性介绍,全面分析了复杂性理论的现代主题。
      本书涉及复杂性理论的很多子领域(如难度放大、伪随机性及概率证明系统等),涵盖了NP完整性、空间复杂性、随机性和计数、伪随机数生成器等内容,还在附录里面介绍了现代密码学基础等。
      本书内容严谨,可读性强,适合作为高年级本科生、研究生的教材。同时,书中展示了复杂性理论的很多子领域,也适合领域专家参考。
  • 作者简介:
      OdedGoldreich,以色列魏茨曼科学研究院(WeizmannInstituteofScience)计算机科学教授,MeyerW.Weisgal讲席教授。他是SIAMJournalonComputing、JournalofCryptology和ComputationalComplexity杂志的特约编辑。其主要研究方向是计算复杂性、随机性与计算以及密码学,他在这几个方面均有享誉世界的研究成果。作为一名活跃的学者,他发表了大量的论文,还著有两卷本的FoundationsofCryptography(《密码学基础》)和ModernCryptography,ProbabilisticProofsandPseudorandomness等专著。
  • 目录:
    1IntroductionandPreliminaries1
    1.1Introduction1
    1.1.1ABriefOverviewofComplexityTheory2
    1.1.2CharacteristicsofComplexityTheory6
    1.1.3ContentsofThisBook8
    1.1.4ApproachandStyleofThisBook12
    1.1.5StandardNotationsandOtherConventions16
    1.2ComputationalTasksandModels17
    1.2.1Representation18
    1.2.2ComputationalTasks18
    1.2.3UniformModels(Algorithms)20
    1.2.4Non-uniformModels(CircuitsandAdvice)36
    1.2.5ComplexityClasses42
    ChapterNotes43

    2P,NP,andNP-Completeness44
    2.1ThePVersusNPQuestion46
    2.1.1TheSearchVersion:FindingVersusChecking47
    2.1.2TheDecisionVersion:ProvingVersusVerifying50
    2.1.3EquivalenceoftheTwoFormulations54
    2.1.4TwoTechnicalCommentsRegardingNP55
    2.1.5TheTraditionalDefinitionofNP55
    2.1.6InSupportofPDifferentfromNP57
    2.1.7PhilosophicalMeditations58
    2.2Polynomial-TimeReductions58
    2.2.1TheGeneralNotionofaReduction59
    2.2.2ReducingOptimizationProblemstoSearchProblems61
    2.2.3Self-ReducibilityofSearchProblems63
    2.2.4DigestandGeneralPerspective67
    2.3NP-Completeness67
    2.3.1Definitions68
    2.3.2TheExistenceofNP-CompleteProblems69
    2.3.3SomeNaturalNP-CompleteProblems71
    2.3.4NPSetsThatAreNeitherinPnorNP-Complete81
    2.3.5ReflectionsonCompleteProblems85
    2.4ThreeRelativelyAdvancedTopics87
    2.4.1PromiseProblems87
    2.4.2OptimalSearchAlgorithmsforNP92
    2.4.3TheClasscoNPandItsIntersectionwithNP94
    ChapterNotes97
    Exercises99

    3VariationsonPandNP108
    3.1Non-uniformPolynomialTime(P/poly)108
    3.1.1BooleanCircuits109
    3.1.2MachinesThatTakeAdvice111
    3.2ThePolynomial-TimeHierarchy(PH)113
    3.2.1AlternationofQuantifiers114
    3.2.2Non-deterministicOracleMachines117
    3.2.3TheP/polyVersusNPQuestionandPH119
    ChapterNotes121
    Exercises122

    4MoreResources,MorePower127
    4.1Non-uniformComplexityHierarchies128
    4.2TimeHierarchiesandGaps129
    4.2.1TimeHierarchies129
    4.2.2TimeGapsandSpeedup136
    4.3SpaceHierarchiesandGaps139
    ChapterNotes139
    Exercises140

    5SpaceComplexity143
    5.1GeneralPreliminariesandIssues144
    5.1.1ImportantConventions144
    5.1.2OntheMinimalAmountofUsefulComputationSpace145
    5.1.3TimeVersusSpace146
    5.1.4CircuitEvaluation153
    5.2LogarithmicSpace153
    5.2.1TheClassL154
    5.2.2Log-SpaceReductions154
    5.2.3Log-SpaceUniformityandStrongerNotions155
    5.2.4UndirectedConnectivity155
    5.3Non-deterministicSpaceComplexity162
    5.3.1TwoModels162
    5.3.2NLandDirectedConnectivity164
    5.3.3ARetrospectiveDiscussion171
    5.4PSPACEandGames172
    ChapterNotes175
    Exercises175

    6RandomnessandCounting184
    6.1ProbabilisticPolynomialTime185
    6.1.1BasicModelingIssues186
    6.1.2Two-SidedError:TheComplexityClassBPP189
    6.1.3One-SidedError:TheComplexityClassesRPandcoRP193
    6.1.4Zero-SidedError:TheComplexityClassZPP199
    6.1.5RandomizedLog-Space199
    6.2Counting202
    6.2.1ExactCounting202
    6.2.2ApproximateCounting211
    6.2.3SearchingforUniqueSolutions217
    6.2.4UniformGenerationofSolutions220
    ChapterNotes227
    Exercises230

    7TheBrightSideofHardness241
    7.1One-WayFunctions242
    7.1.1GeneratingHardInstancesandOne-WayFunctions243
    7.1.2AmplificationofWeakOne-WayFunctions245
    7.1.3Hard-CorePredicates250
    7.1.4ReflectionsonHardnessAmplification255
    7.2HardProblemsinE255
    7.2.1AmplificationwithRespecttoPolynomial-SizeCircuits257
    7.2.2AmplificationwithRespecttoExponential-SizeCircuits270
    ChapterNotes277
    Exercises278

    8PseudorandomGenerators284
    Introduction285
    8.1TheGeneralParadigm288
    8.2General-PurposePseudorandomGenerators290
    8.2.1TheBasicDefinition291
    8.2.2TheArchetypicalApplication292
    8.2.3ComputationalIndistinguishability295
    8.2.4AmplifyingtheStretchFunction299
    8.2.5Constructions301
    8.2.6Non-uniformlyStrongPseudorandomGenerators304
    8.2.7StrongerNotionsandConceptualReflections305
    8.3DerandomizationofTime-ComplexityClasses307
    8.3.1DefiningCanonicalDerandomizers308
    8.3.2ConstructingCanonicalDerandomizers310
    8.3.3TechnicalVariationsandConceptualReflections313
    8.4Space-BoundedDistinguishers315
    8.4.1DefinitionalIssues316
    8.4.2TwoConstructions318
    8.5Special-PurposeGenerators325
    8.5.1PairwiseIndependenceGenerators326
    8.5.2Small-BiasGenerators329
    8.5.3RandomWalksonExpanders332
    ChapterNotes334
    Exercises337

    9ProbabilisticProofSystems349
    9.1InteractiveProofSystems352
    9.1.1MotivationandPerspective352
    9.1.2Definition354
    9.1.3ThePowerofInteractiveProofs357
    9.1.4VariantsandFinerStructure:AnOverview363
    9.1.5OnComputationallyBoundedProvers:AnOverview366
    9.2Zero-KnowledgeProofSystems368
    9.2.1DefinitionalIssues369
    9.2.2ThePowerofZero-Knowledge372
    9.2.3ProofsofKnowledge-AParentheticalSubsection378
    9.3ProbabilisticallyCheckableProofSystems380
    9.3.1Definition381
    9.3.2ThePowerofProbabilisticallyCheckableProofs383
    9.3.3PCPandApproximation398
    9.3.4MoreonPCPItself:AnOverview401
    ChapterNotes404
    Exercises406

    10RelaxingtheRequirements416
    10.1Approximation417
    10.1.1SearchorOptimization418
    10.1.2DecisionorPropertyTesting423
    10.2Average-CaseComplexity428
    10.2.1TheBasicTheory430
    10.2.2Ramifications442
    ChapterNotes451
    Exercises453

    Epilogue461
    AppendixA:GlossaryofComplexityClasses463
    A.1Preliminaries463
    A.2Algorithm-BasedClasses464
    A.2.1TimeComplexityClasses464
    A.2.2SpaceComplexityClasses467
    A.3Circuit-BasedClasses467

    AppendixB:OntheQuestforLowerBounds469
    B.1Preliminaries469
    B.2BooleanCircuitComplexity471
    B.2.1BasicResultsandQuestions472
    B.2.2MonotoneCircuits473
    B.2.3Bounded-DepthCircuits473
    B.2.4FormulaSize474
    B.3ArithmeticCircuits475
    B.3.1UnivariatePolynomials476
    B.3.2MultivariatePolynomials476
    B.4ProofComplexity478
    B.4.1LogicalProofSystems480
    B.4.2AlgebraicProofSystems480
    B.4.3GeometricProofSystems481

    AppendixC:OntheFoundationsofModernCryptography482
    C.1IntroductionandPreliminaries482
    C.1.1TheUnderlyingPrinciples483
    C.1.2TheComputationalModel485
    C.1.3OrganizationandBeyond486
    C.2ComputationalDifficulty487
    C.2.1One-WayFunctions487
    C.2.2Hard-CorePredicates489
    C.3Pseudorandomness490
    C.3.1ComputationalIndistinguishability490
    C.3.2PseudorandomGenerators491
    C.3.3PseudorandomFunctions492
    C.4Zero-Knowledge494
    C.4.1TheSimulationParadigm494
    C.4.2TheActualDefinition494
    C.4.3AGeneralResultandaGenericApplication495
    C.4.4DefinitionalVariationsandRelatedNotions497
    C.5EncryptionSchemes500
    C.5.1Definitions502
    C.5.2Constructions504
    C.5.3BeyondEavesdroppingSecurity505
    C.6SignaturesandMessageAuthentication507
    C.6.1Definitions508
    C.6.2Constructions509
    C.7GeneralCryptographicProtocols511
    C.7.1TheDefinitionalApproachandSomeModels512
    C.7.2SomeKnownResults517
    C.7.3ConstructionParadigmsandTwoSimpleProtocols517
    C.7.4ConcludingRemarks522

    AppendixD:ProbabilisticPreliminariesandAdvancedTopicsinRandomization523
    D.1ProbabilisticPreliminaries523
    D.1.1NotationalConventions523
    D.1.2ThreeInequalities524
    D.2Hashing528
    D.2.1Definitions528
    D.2.2Constructions529
    D.2.3TheLeftoverHashLemma529
    D.3Sampling533
    D.3.1FormalSetting533
    D.3.2KnownResults534
    D.3.3Hitters535
    D.4RandomnessExtractors536
    D.4.1DefinitionsandVariousPerspectives537
    D.4.2Constructions541
    AppendixE:ExplicitConstructions545
    E.1Error-CorrectingCodes546
    E.1.1BasicNotions546
    E.1.2AFewPopularCodes547
    E.1.3TwoAdditionalComputationalProblems551
    E.1.4AList-DecodingBound553
    E.2ExpanderGraphs554
    E.2.1DefinitionsandProperties555
    E.2.2Constructions561
    AppendixF:SomeOmittedProofs566
    F.1ProvingThatPHReducesto#P566
    F.2ProvingThatIP(f)?AM(O(f))?AM(f)572
    F.2.1EmulatingGeneralInteractiveProofsbyAM-Games572
    F.2.2LinearSpeedupforAM578
    AppendixG:SomeComputationalProblems583
    G.1Graphs583
    G.2BooleanFormulae585
    G.3FiniteFields,Polynomials,andVectorSpaces586
    G.4TheDeterminantandthePermanent587
    G.5PrimesandCompositeNumbers587
    Bibliography589
    Index601
查看详情
系列丛书 / 更多
计算复杂性
算法(英文版•第4版)
[美]塞奇威克(Robert Sedgewick)、[美]韦恩(Kevin Wayne) 著
计算复杂性
计算机程序设计艺术(第2卷 英文版·第3版):半数值算法
[美]高德纳 著
计算复杂性
计算机程序设计艺术,卷4A:组合算法(一)(英文版)
[美]Donald E.Knuth 著
计算复杂性
计算机程序设计艺术(第3卷 英文版·第2版):排序与查找
[美]高德纳(Knuth D.E) 著
计算复杂性
C++Primer(英文版)(第4版)
李普曼 著
计算复杂性
UNIX环境高级编程
史蒂文斯、拉戈 著
计算复杂性
信息检索:算法与启发式方法(英文版·第2版)
[美]格罗斯曼、[美]弗里德 著
计算复杂性
数据结构与算法分析:C++描述(英文版)(第3版)
[美]维斯 著
计算复杂性
Web数据挖掘:超文本数据的知识发现
[印]查凯莱巴蒂 著
计算复杂性
TCP/IP 详解(卷2):实现(英文版)
[美]赖特(Gary R.Wright)、[美]史蒂文斯(W.Richard Stevens) 著
计算复杂性
IPv6详解,第1卷,核心协议实现:IPv6时代的《TCP/IP详解》!
[美]李清、[日]神明达哉、[日]岛庆一 著
计算复杂性
TCP/IP详解 卷1:协议(英文版):协议-TCP/IP详解-英文版
[美]史蒂文斯 著
相关图书 / 更多
计算复杂性
计算机基础与实训教程
顾玲芳 编
计算复杂性
计算机网络攻击与防护
刘念;陈雪松;谈洪磊
计算复杂性
计算机组成原理与汇编语言
田民格、秦彩杰、林观俊、田佳琪
计算复杂性
计算天文
冯毅
计算复杂性
计算思维培养与无人机创意编程
范谊 陈宇 张锦东
计算复杂性
计算机组成原理与系统结构(第3版)
冯建文 章复嘉 赵建勇 包健 编著
计算复杂性
计算小状元 小学数学 2年级上册 bs版 小学数学单元测试 新华
作者
计算复杂性
计算机应用基础
苗苗
计算复杂性
计算机系统原理(2023年版) 全国高等教育自学考试指导委员会
全国高等教育自学考试指导委员会
计算复杂性
计算机组装与维护(第3版高等院校计算机应用技术规划教材)
孙中胜 编
计算复杂性
计算机辅助翻译教程()
赵秋荣
计算复杂性
计算机三维建模方法
易健宏 编著;李凤仙
您可能感兴趣 / 更多
计算复杂性
最棒的狗狗 从小狗奇力身上学习用乐观心态应对竞争压力,勇敢面对挑战
[以色列]加利亚·伯恩斯坦
计算复杂性
耶路撒冷:一座伟大的城市(被揉碎的世界中心,《耶路撒冷三千年》译者倾情翻译,走进这座灿烂无比却又伤痕累累的伟大城市)
[以色列]约瑟夫·米利斯
计算复杂性
(以色列研究经典译丛)以色列外交史:星与权杖
[以色列]伊曼纽尔·纳冯 著;李兰兰 译;关媛
计算复杂性
尤瓦·左默艺术科普绘本:全2册(繁花+自然世界,献给所有热爱大自然喜欢探索有冒险精神孩子的科普绘本)
[以色列]尤瓦·左默 绘者
计算复杂性
走进奇妙的自然世界:尤瓦左默艺术科普图画书(精装,大开本)
[以色列]尤瓦·左默 绘者
计算复杂性
一个完整的巴勒斯坦--英国委任统治时期的犹太人与阿拉伯人(地区研究丛书)
[以色列]汤姆·塞格夫 著;丁辰熹 译
计算复杂性
好望角丛书·为了国家,不惜一切:本-古里安传
[以色列]汤姆·塞格夫
计算复杂性
诺贝尔儿童经济学漫画
[以色列]艾迪拉莫 图;文:(以色列)优尼特˙维博
计算复杂性
玩具岛梦幻之旅(99)(“以色列奖”得主经典作品)
[以色列]米里亚姆·雅兰-施泰克丽丝
计算复杂性
BIM手册 (原著第三版)
[以色列]拉斐尔·萨克斯(Rafael Sacks) (美)查尔斯·伊斯曼(Charles Eastman) (韩)李刚(Ghang Lee)
计算复杂性
洞悉对手:领导人、情报部门与国际关系中的意图评估
[以色列]克伦·亚希-米洛 著;曹德军 译
计算复杂性
光学检验与测试
[以色列]迈克尔·豪斯纳(MichaelHausner 著