1 citations · 1 across the 4 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016★ 1 cited
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
Alexander S. Kulikov, Vladimir V. Podolskii
We study the following computational problem: for which values of , the majority of bits can be computed with a depth two formula whose each gate computes a m…
cs.DS2016
Tight Lower Bounds on Graph Embedding Problems
Marek Cygan, Fedor V. Fomin, Alexander Golovnev +4
We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph to graph cannot be done in time . We al…