Pages that link to "Item:Q3196391"
From MaRDI portal
The following pages link to Lower Bounds for the Size of Nondeterministic Circuits (Q3196391):
Displaying 12 items.
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- On the power of nondeterministic circuits and co-nondeterministic circuits (Q2232269) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958) (← links)
- On Circuit-Size Complexity and the Low Hierarchy in NP (Q3675520) (← links)
- (Q3817611) (← links)
- Circuit Definitions of Nondeterministic Complexity Classes (Q4016401) (← links)
- The strength of non-size increasing computation (Q5178911) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311109) (← links)
