Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AC0ACC0AND gateBoolean circuit

Broader (1)

Circuit complexity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Range query estimation with data skewness for top-k retrieval
2013
2013
Oscillator Frequency Offset Impact on Software GPS Receivers and Correction Algorithms
Software-based Global Positioning System (GPS) receivers have been recognized as an effective research platform in recent years… 
2012
2012
Phase ordering kinetics of second-phase formation near an edge dislocation
The time-dependent Ginzburg-Landau (TDGL) equation for a single component non-conservative structural order parameter is used to… 
2012
2012
Lower Bounds against Weakly Uniform Circuits
A family of Boolean circuits \(\{C_n\}_{n\geqslant 0}\) is called γ(n)-weakly uniform if there is a polynomial-time algorithm for… 
2011
2011
Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata
The aim of this paper is to propose a proof-complexity framework for concurrent automata. Since the behavior of concurrent… 
Highly Cited
2009
Highly Cited
2009
Planar and Grid Graph Reachability Problems
AbstractWe study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for $\mathsf… 
2009
2009
Preparation of electron-doped La2−xCexCuO4±δ thin films with various Ce doping by dc magnetron sputtering
2001
2001
Is Multiplication Harder than Addition? Arithmetical Definability over Finite Structures
1999
1999
Logics with counting, auxiliary relations, and lower bounds for invariant queries
  • L. Libkin
  • Proceedings. 14th Symposium on Logic in Computer…
  • 1999
  • Corpus ID: 7369014
We study the expressive power of counting logics in the presence of auxiliary relations such as orders and pre-orders. The… 
1997
1997
Asynchronous direct-sequence code-division multiple access systems : low complexity data detection and robust detectors
Asynchronous direct-sequence code-division multiple access systems : low complexity data detection and robust detectors 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)