#
complexité calcul
Resource Information
The concept ** complexité calcul** represents the subject, aboutness, idea or notion of resources found in **Boston University Libraries**.

The Resource
complexité calcul
Resource Information

The concept

**complexité calcul**represents the subject, aboutness, idea or notion of resources found in**Boston University Libraries**.- Label
- complexité calcul

## Context

Context of complexité calcul#### Subject of

- A general theory of optimal algorithms
- ACM Turing Award lectures : the first twenty years, 1966 to 1985
- Advances in computing science, ASIAN '98 : 4th Asian Computing Science Conference, Manila, the Philippines, December 8-10, 1998 : proceedings
- Algorithm engineering and experimentation : third international workshop, ALENEX 2001, WAshington, DC, USA, January 5-6, 2001 : revised papers
- Algorithmic information theory
- Algorithmics : theory and practice
- Algorithms in modern mathematics and computer science : proceedings, Urgench, Uzbek SSR, September 16-22, 1979
- Alternating sequential/parallel processing
- Applied algebra, algebraic algorithms, and error-correcting codes : 5th International Conference, AAECC-5, Menorca, Spain, June 15-19, 1987 : proceedings
- Arithmetic complexity of computations
- Bounded arithmetic, propositional logic, and complexity theory
- Codes and cryptography
- Complexity and structure
- Complexity in information theory
- Complexity of computer computations; : proceedings.
- Complexity theory of real functions
- Computability, complexity, and languages : fundamentals of theoretical computer science
- Computability, complexity, logic
- Computation and automata
- Computational complexity
- Computational complexity theory
- Computational vision
- Computer algebra : EUROCAM'82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
- Descriptive complexity
- Discrete algorithms and complexity : proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan
- Discrete optimization
- Elements of the theory of computation
- Feasible computations and provable complexity properties
- Foundations of computation theory : proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983
- Gems of theoretical computer science
- Generalized quantifiers and computation : 9th European Summer School in Logic, Language, and Information, ESSLLI'97 workshop : Aix-en-Provence, France, August 11-22, 1997 : revised lectures
- Group-theoretic algorithms and graph isomorphism
- Information, uncertainty, complexity
- Information-based complexity
- Integer programming and combinatorial optimization : 7th International IPCO Conference, Graz, Austria, June 9-11, 1999 : proceedings
- Introduction to automata theory, languages, and computation
- Introduction to the theory of complexity
- Kolmogorov complexity and computational complexity
- Logic and machines : decision problems and complexity : Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut für Mathematische Logik und Frundlagenforschung der Universität Münster/Westfalen
- Neural networks and analog computation : beyond the Turing limit
- On the integration of algebraic functions
- Pi and the AGM : a study in analytic number theory and computational complexity
- Proceedings : Fifth Annual IEEE Symposium on Logic in Computer Science, June 4-7, 1990, Philadelphia, PA
- Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory : July 26th-28th, 1993, Santa Cruz, Calif.
- Randomness and completeness in computational complexity
- Scheduling algorithms
- Some methode [i.e. methods] in the mathematical analysis of systems and their control
- The combinatorics of network reliability
- The complexity of Boolean functions
- The computational complexity of logical theories
- The computational complexity of machine learning
- The influence of computing on mathematical research and education; : [proceedings.
- The problem of incomplete information in relational databases
- The theory of computability : programs, machines, effectiveness, and feasibility
- Theoretical computer science : 5th GI-conference, Karlsruhe, March 23-25, 1981
- Theories of abstract automata
- Theory of algorithms
- Theory of semi-feasible algorithms
- Topics in the theory of computation : selected papers of the International Conference on "Foundations of Computation Theory", FCT '83, Borgholm, Sweden, August 21-27, 1983
- Trees in algebra and programming : 6th colloquium, Genoa, March 5-7, 1981 : proceedings
- 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/XhoFUN-pNJQ/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/XhoFUN-pNJQ/">complexité calcul</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é calcul

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/XhoFUN-pNJQ/" typeof="CategoryCode http://bibfra.me/vocab/lite/Concept"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/XhoFUN-pNJQ/">complexité calcul</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>`