On monotone circuits with local oracles and clique lower bounds

DOI10.4086/cjtcs.2018.001zbMath1398.68163arXiv1704.06241OpenAlexW3106231679MaRDI QIDQ4578330

Igor C. Oliveira, Jan Krajíček

Publication date: 8 August 2018

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.06241

zbMATH Keywords

monotone circuitsproof complexity\(k\)-clique problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity of proofs (03F20)

Related Items (2)

Randomized feasible interpolation and monotone circuits with a local oracle ⋮ Resolution with counting: dag-like lower bounds and different moduli

This page was built for publication: On monotone circuits with local oracles and clique lower bounds