About: dbpedia:Computational_complexity

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: dbpedia:Computational_complexity_theory Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : platform.yourdatastories.eu:8890 associated with source document(s)

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

Attributes	Values
rdfs:comment	Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
rdfs:seeAlso	dbpedia:Combinatorial_explosion
foaf:depiction
thumbnail	http://commons.wikimedia.org/wiki/Special:FilePath/TSP_Deutschland_3.png?width=300
is field of	Ferrara, Sergio Salil Vadhan Dinur, Irit Christos Papadimitriou Williams, Ryan Safra, Shmuel Ajtai, Miklós Umesh Vazirani Aaronson, Scott David Shmoys Georg Gottlob Delahaye, Jean-Paul
is known for of	Bakhvalov, Nikolai Stepanovich Book, Ronald V.

Faceted Search & Find service v1.13.91 as of Nov 14 2017

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3212 as of Mar 29 2016, on Linux (x86_64-unknown-linux-gnu), Single-Server Edition (68 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software