Pages that link to "Item:Q1977414"

The following pages link to Separation of the monotone NC hierarchy (Q1977414):

Displaying 41 items.

• The depth of resolution proofs (Q647405) (← links)
• Incremental branching programs (Q929291) (← links)
• Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
• The expressiveness of DAC (Q1608890) (← links)
• The direct sum of universal relations (Q1751432) (← links)
• Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
• Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
• Large clique is hard on average for resolution (Q2117104) (← links)
• Communication complexity of approximate Nash equilibria (Q2155907) (← links)
• Simulation theorems via pseudo-random properties (Q2281252) (← links)
• On derandomized composition of Boolean functions (Q2281253) (← links)
• Dag-like communication and its applications (Q2399382) (← links)
• Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
• Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
• On the Decomposability of $NC$ and $AC$ (Q3034828) (← links)
• Reversible Pebble Game on Trees (Q3196374) (← links)
• The Range of Topological Effects on Communication (Q3449503) (← links)
• Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
• Deterministic Communication vs. Partition Number (Q4562279) (← links)
• Structure of Protocols for XOR Functions (Q4605274) (← links)
• Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
• (Q4989407) (← links)
• Stabbing planes (Q4993273) (← links)
• Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
• From Expanders to Hitting Distributions and Simulation Theorems (Q5005099) (← links)
• (Q5088887) (← links)
• (Q5089146) (← links)
• Adventures in monotone complexity and TFNP (Q5090415) (← links)
• Lifting Theorems for Equality (Q5090501) (← links)
• Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
• Query-to-Communication Lifting for BPP (Q5117373) (← links)
• (Q5121903) (← links)
• A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
• Monotone circuit lower bounds from resolution (Q5140848) (← links)
• Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
• Strongly Exponential Separation between Monotone VP and Monotone VNP (Q5862285) (← links)
• Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
• Rectangles are nonnegative juntas (Q5890971) (← links)
• Communication lower bounds of key-agreement protocols via density increment arguments (Q6582217) (← links)
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)