#
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

- Source
- fast

## Context

Context of Computational complexity#### Subject of

- A guide to algorithm design : paradigms, methods, and complexity analysis
- A new kind of science : hearing before the Subcommittee on Science, Technology, and Space of the Committee on Commerce, Science, and Transportation, United States Senate, One Hundred Eighth Congress, first session, September 4, 2003
- 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 25-28, 2012 : selected and invited papers
- Algorithms : their complexity and efficiency
- Algorithms and complexity
- Algorithms and theory of computation handbook
- Algorithms and theory of computation handbook
- Arithmetic complexity of computations
- Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008 ; proceedings, Part II
- Big data integration theory : theory and methods of database mappings, programming languages, and semantics
- Boolean function complexity : advances and frontiers
- Bounded arithmetic
- Can markets compute equilibria?
- Causality, probability, and time
- Classical and quantum computation
- Combinatorial algorithms : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, revised selected papers
- Communication complexity
- Communication complexity : a new approach to circuit depth
- Complex strategic choices : applying systemic planning for strategic decision making
- Complex systems and dependability
- Complexity and structure
- Complexity in information theory
- Complexity theory : current research
- Complexity theory : encyclopedia article
- Complexity theory of real functions
- Computability and complexity theory
- Computability and complexity theory
- Computability and randomness
- Computability, complexity, and languages : fundamentals of theoretical computer science
- Computability, complexity, and languages : fundamentals of theoretical computer science
- Computation and automata
- Computational complexity
- Computational complexity
- Computational complexity : a conceptual perspective
- Computational complexity : a modern approach
- Computational complexity : theory, techniques, and applications
- Computational complexity and natural language
- Computational geometry and graphs : Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised selected papers
- Computational limitations for small-depth circuits
- Computers and intractability : a guide to the theory of NP-completeness
- Conquering complexity
- Data complexity in pattern recognition
- Exploring randomness
- Fast Software Encryption, 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers
- Feasible computations and provable complexity properties
- Finite model theory and its applications
- Forcing with random variables and proof complexity
- Foundations of algorithms
- Foundations of information and knowledge systems : 8th international symposium, FoIKS 2014, Bordeaux, France, March 3-7, 2014 : proceedings
- Honest polynomial degrees and P=? NP
- In search of elegance in the theory and practice of computation : essays dedicated to Peter Buneman
- Information-theoretic incompleteness
- Introduction to computability
- Introduction to the theory of complexity
- Learning and intelligent optimization : 7th International Conference, LION 7, Catania, Italy, January 7-11, 2013, revised selected papers
- Lecture notes on descriptional complexity and randomness
- Methods of optimization and systems analysis for problems of transcomputational complexity
- Model emergent dynamics in complex systems
- Models of science dynamics : encounters between complexity theory and information sciences
- Modern applications of automata theory
- Modified branching programs and their computational power
- Natural complexity : a modeling handbook
- Noisy information and computational complexity
- Nonlinear dimensionality reduction
- Number theory and cryptography : papers in honor of Johannes Buchmann on the occasion of his 60th birthday
- P, NP, and NP-completeness : the basics of computational complexity
- Parameterized and exact computation : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised selected papers
- 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
- Problem solving in automata, languages, and complexity
- Problems of reducing the exhaustive search
- Pseudorandomness and cryptographic applications
- Randomized algorithms : approximation, generation, and counting
- Randomness and completeness in computational complexity
- SAT 2005 : satisfiability research in the year 2005
- Sparsity : graphs, structures, and algorithms
- Studies in complexity and cryptography : miscellanea on the interplay between randomness and computation
- Studies in complexity theory
- Substitutions in dynamics, arithmetics, and combinatorics
- The complexity of Boolean functions
- The complexity of Boolean networks
- The complexity of computing
- The computational complexity of algebraic and numeric problems
- The computational complexity of logical theories
- The computational complexity of machine learning
- The discrepancy method : randomness and complexity
- The language complexity game
- The multivariate algorithmic revolution and beyond : essays dedicated to Michael R. Fellows on the occasion of his 60th birthday
- The nature of change or the law of unintended consequences : an introductory text to designing complex systems and managing change
- The theory of computability : programs, machines, effectiveness, and feasibility
- Theory of computational complexity
- Theory of semi-feasible algorithms
- Time warps, string edits, and macromolecules : the theory and practice of sequence comparison
- Topics in the general theory of structures
- Transactions on Computational Science II
- Transactions on Rough Sets XIII
- Transactions on computational science I
- Transactions on computational science III
- Transactions on computational science V : special issue on cognitive knowledge representation
- Transactions on computational science VI
- Unified computational intelligence for complex systems
- 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 fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/resource/7hrNWlgl1yc/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/7hrNWlgl1yc/">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 fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/resource/7hrNWlgl1yc/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/7hrNWlgl1yc/">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>`