About: TC (complexity)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: TC (complexity) Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC is a complexity class of decision problems that can be recognized by threshold circuits, which are Boolean circuits with AND, OR, and Majority gates. For each fixed i, the complexity class TCi consists of all languages that can be recognized by a family of threshold circuits of depth , polynomial size, and unbounded fan-in. The class TC is defined via

Attributes	Values
rdfs:label	TC (complexity) (en)
rdfs:comment	In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC is a complexity class of decision problems that can be recognized by threshold circuits, which are Boolean circuits with AND, OR, and Majority gates. For each fixed i, the complexity class TCi consists of all languages that can be recognized by a family of threshold circuits of depth , polynomial size, and unbounded fan-in. The class TC is defined via (en)
sameAs	TC (complexity) TC (complexity)
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Reflist dbt:ComplexityClasses
Subject	Circuit complexity Complexity classes
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/TC_(complexity)?oldid=918694245&ns=0
Wikipage page ID	26200497 (xsd:integer)
page length (characters) of wiki page	2895 (xsd:nonNegativeInteger)
Wikipage revision ID	918694245 (xsd:integer)
has abstract	In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC is a complexity class of decision problems that can be recognized by threshold circuits, which are Boolean circuits with AND, OR, and Majority gates. For each fixed i, the complexity class TCi consists of all languages that can be recognized by a family of threshold circuits of depth , polynomial size, and unbounded fan-in. The class TC is defined via (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/TC_(complexity)
is Link from a Wikipage to another Wikipage of	Circuit (computer science)

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software