TC0 is a complexity class used in circuit complexity. It is the first class in the hierarchy of TC classes. TC0 contains all languages which are decided by Boolean circuits with constant depth and polynomial size, containing only unbounded fan-in AND gates, OR gates, NOT gates, and majority gates. Equivalently, can be used instead of majority gates. TC0 contains several important problems, such as sorting n n-bit numbers, multiplying two n-bit numbers, integer division or recognizing the Dyck language with two types of parentheses.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| |
rdfs:comment
| - La classe de complexitat TC0 és usada en complexitat de circuits. És la primera classe de la jerarquia de les classes TC. La classe TC0 conté tots els llenguatges que son decidibles per un circuit booleà amb profunditat constant i mida polinòmica, format només per portes AND, OR, NOT i majoria. Equivalentment, es poden usar portes de llindar enlloc de portes de majoria. Aquesta classe conté problemes força importants, com el d'ordenar n nombres de n bits, multiplicar dos nombres de n bits, la divisió entera o reconèixer el llenguatge de Dyck amb dos tipus de parèntesis. (ca)
- TC0 is a complexity class used in circuit complexity. It is the first class in the hierarchy of TC classes. TC0 contains all languages which are decided by Boolean circuits with constant depth and polynomial size, containing only unbounded fan-in AND gates, OR gates, NOT gates, and majority gates. Equivalently, can be used instead of majority gates. TC0 contains several important problems, such as sorting n n-bit numbers, multiplying two n-bit numbers, integer division or recognizing the Dyck language with two types of parentheses. (en)
|
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
has abstract
| - La classe de complexitat TC0 és usada en complexitat de circuits. És la primera classe de la jerarquia de les classes TC. La classe TC0 conté tots els llenguatges que son decidibles per un circuit booleà amb profunditat constant i mida polinòmica, format només per portes AND, OR, NOT i majoria. Equivalentment, es poden usar portes de llindar enlloc de portes de majoria. Aquesta classe conté problemes força importants, com el d'ordenar n nombres de n bits, multiplicar dos nombres de n bits, la divisió entera o reconèixer el llenguatge de Dyck amb dos tipus de parèntesis. (ca)
- TC0 is a complexity class used in circuit complexity. It is the first class in the hierarchy of TC classes. TC0 contains all languages which are decided by Boolean circuits with constant depth and polynomial size, containing only unbounded fan-in AND gates, OR gates, NOT gates, and majority gates. Equivalently, can be used instead of majority gates. TC0 contains several important problems, such as sorting n n-bit numbers, multiplying two n-bit numbers, integer division or recognizing the Dyck language with two types of parentheses. (en)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is foaf:primaryTopic
of | |