Computational complexity
Resource Information
The concept Computational complexity represents the subject, aboutness, idea or notion of resources found in Boston University Libraries.
The Resource
Computational complexity
Resource Information
The concept Computational complexity represents the subject, aboutness, idea or notion of resources found in Boston University Libraries.
 Label
 Computational complexity
 Authority link

 http://id.worldcat.org/fast/00871991
 (uri) http://id.loc.gov/authorities/subjects/sh85029473
 Source
 fast
Context
Context of Computational complexitySubject of
 A guide to algorithm design : paradigms, methods, and complexity analysis
 A primer on pseudorandom generators
 Algebraic and algorithmic aspects of differential and integral operators : 5th International Meeting, AADIOS 2012, held at the Applications of Computer Algebra Conference, ACA 2012, Sofia, Bulgaria, June 2528, 2012 : selected and invited papers
 Algorithmic information theory
 Algorithms : their complexity and efficiency
 Algorithms and theory of computation handbook
 Arithmetic complexity of computations
 Arithmetic, proof theory, and computational complexity
 Bounded arithmetic
 Bounded arithmetic, propositional logic, and complexity theory
 Causality, probability, and time
 Classical and quantum computation
 Complex strategic choices : applying systemic planning for strategic decision making
 Complex systems and dependability
 Complexity : knots, colourings, and counting
 Complexity and structure
 Complexity theory : current research
 Complexity theory of real functions
 Computability and randomness
 Computability, complexity, and languages : fundamentals of theoretical computer science
 Computability, complexity, and languages : fundamentals of theoretical computer science
 Computability, complexity, logic
 Computation and automata
 Computation theory and logic
 Computational complexity
 Computational complexity : a modern approach
 Computational complexity and natural language
 Computational complexity theory
 Computers and intractability : a guide to the theory of NPcompleteness
 Conquering complexity
 Descriptive complexity
 Feasible computations and provable complexity properties
 Finite automata, formal logic, and circuit complexity
 Honest polynomial degrees and P=? NP
 Informationtheoretic incompleteness
 Introduction to automata theory, languages, and computation
 Introduction to computability
 Introduction to the theory of complexity
 Logic and computer science
 Modified branching programs and their computational power
 Nonlinear dimensionality reduction
 Parallel complexity theory
 Parameterized complexity theory
 People, problems, and proofs : essays from Gödel's Lost Letter: 2010
 Pi and the AGM : a study in analytic number theory and computational complexity
 Polynomial time creativity and its applications
 Randomness and completeness in computational complexity
 Sparsity : graphs, structures, and algorithms
 Structural complexity
 Substitutions in dynamics, arithmetics, and combinatorics
 The complexity of Boolean functions
 The complexity of Boolean networks
 The computational complexity of logical theories
 The computational complexity of machine learning
 The discrepancy method : randomness and complexity
 The language complexity game
 Transactions on computational science VI
 Using hard problems to create pseudorandom generators
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/ZuUsROqeRHc/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/ZuUsROqeRHc/">Computational complexity</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Concept Computational complexity
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/ZuUsROqeRHc/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/ZuUsROqeRHc/">Computational complexity</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>