Complexité de calcul (Informatique)
Resource Information
The concept Complexité de calcul (Informatique) represents the subject, aboutness, idea or notion of resources found in Boston University Libraries.
The Resource
Complexité de calcul (Informatique)
Resource Information
The concept Complexité de calcul (Informatique) represents the subject, aboutness, idea or notion of resources found in Boston University Libraries.
- Label
- Complexité de calcul (Informatique)
56 Items that share the Concept Complexité de calcul (Informatique)
Context
Context of Complexité de calcul (Informatique)Subject of
No resources found
No enriched resources found
- A general theory of optimal algorithms
- A new kind of science
- Algorithmic information theory
- Algorithms : their complexity and efficiency
- Algorithms and complexity
- Algorithms and theory of computation handbook
- Arithmetic complexity of computations
- Arithmetic, proof theory, and computational complexity
- Boolean functions and computation models
- Bounded arithmetic, propositional logic, and complexity theory
- Classical and quantum computation
- Communication complexity : a new approach to circuit depth
- Communication complexity and parallel computing
- Complexity and structure
- Complexity theory of real functions
- Computability, complexity, and languages : fundamentals of theoretical computer science
- Computability, complexity, logic
- Computation and automata
- Computation theory and logic
- Computational complexity
- Computational complexity and natural language
- Computational complexity theory
- Computational limitations for small-depth circuits
- Computers and intractability : a guide to the theory of NP-completeness
- Descriptive complexity
- Elements of the theory of computation
- Elements of the theory of computation
- Exploring randomness
- Feasible computations and provable complexity properties
- Fundamenta informaticae
- Information, uncertainty, complexity
- Information-based complexity
- Introduction to automata theory, languages, and computation
- Modified branching programs and their computational power
- Neural network design and the complexity of learning
- Parallel complexity theory
- Parameterized complexity theory
- Pi and the AGM : a study in analytic number theory and computational complexity
- Problem solving in automata, languages, and complexity
- Randomized algorithms : approximation, generation, and counting
- Randomness and completeness in computational complexity
- Structural complexity
- Studies in complexity theory
- Substitutions in dynamics, arithmetics, and combinatorics
- The complexity of Boolean functions
- The complexity of Boolean networks
- The complexity theory companion
- 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 theory of computability : programs, machines, effectiveness, and feasibility
- Time warps, string edits, and macromolecules : the theory and practice of sequence comparison
- Tractable reasoning in artificial intelligence
- Using hard problems to create pseudorandom generators
Embed
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/Ej6qDCIFz38/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/Ej6qDCIFz38/">Complexité de calcul (Informatique)</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 Complexité de calcul (Informatique)
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/Ej6qDCIFz38/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/Ej6qDCIFz38/">Complexité de calcul (Informatique)</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>
