The following pages link to On uniform circuit complexity (Q1152951):
Displaying 36 items.
- Relativizing small complexity classes and their theories (Q260396) (← links)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- On theories of bounded arithmetic for \(\mathrm{NC}^1\) (Q638497) (← links)
- A sorting network in bounded arithmetic (Q638498) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- The effective entropies of some extensions of context-free languages (Q751289) (← links)
- Effective entropies and data compression (Q751832) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- (Q5089032) (← links)
- Reversals and alternation (Q5096156) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)
- (Q5136328) (← links)
- On log-time alternating Turing machines of alternation depth k (Q6085715) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
- On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 (Q6135711) (← links)
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q6169898) (← links)
- Recursively divisible problems (Q6487438) (← links)
- Logspace verifiers, NC, and NP (Q6487945) (← links)
