The following pages link to On uniform circuit complexity (Q1152951):
Displaying 50 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)
- Parallel complexity of the regular code problem (Q913513) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- On the computational power of binary decision diagram with redundant variables. (Q960508) (← links)
- Reductions to graph isomorphism (Q987394) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Space-bounded hierarchies and probabilistic computations (Q1062759) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity (Q1076669) (← links)
- Array processing machines: an abstract model (Q1094879) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits (Q1108006) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- Efficient parallel circuits and algorithms for division (Q1114393) (← links)
- A measure of relativized space which is faithful with respect to depth (Q1115190) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
