TC0

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2016
02419952016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Recently, Macdonald et. al. showed that many algorithmic problems for finitely generated nilpotent groups including computation… (More)
Is this relevant?
2015
2015
The elementary arithmetic operations +, ·,≤ on integers are well-known to be computable in the weak complexity class TC, and it… (More)
Is this relevant?
2014
2014
Rational proofs, recently introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
In this paper we consider the problem of proving lower bounds for the permanent. An ongoing line of research has shown super… (More)
Is this relevant?
2011
2011
An algorithmic meta theorem for a logic and a class C of structures states that all problems expressible in this logic can be… (More)
Is this relevant?
2006
2006
We present a general method for introducing finitely axiomatizable “minimal” two-sorted theories for various subclasses of P… (More)
Is this relevant?
2005
2005
We characterize the languages in TC0 = L(Maj[<,Bit]) and L(Maj[<]) as inverse morphic images of certain groups. Necessarily these… (More)
Is this relevant?
2001
2001
Integer division has been known since 1986 [4,13,12] to be in slightly non-uniform TC, i.e., computable by polynomial-size… (More)
Is this relevant?
2001
2001
A set F of Boolean functions is called a pseudorandom function generator (PRFG) if communicating with a randomly chosen secret… (More)
Is this relevant?
1997
1997
Continuing a line of investigation that has studied the function classes #P [Val79b], #SAC1 [Val79a, Vin91, AJMV], #L [AJ93b… (More)
  • figure 1
  • figure 2
Is this relevant?