Interpolation by a Game

@article{Krajcek1997InterpolationBA,
  title={Interpolation by a Game},
  author={Jan Kraj{\'i}cek},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={1997},
  volume={4}
}
We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game, cf..3]) and real communication complexity, and relate them to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (deened in 4, Def. 2.2]) of small real communication complexity solving the monotone communication complexity problem associated with the bipartite perfect matching problem. This work is motivated by a research in interpolation… CONTINUE READING

From This Paper

Topics from this paper.
2 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Lower bounds for resolution and cutting planes proofs and monotone computations

  • P Pudll Ak
  • J. Symbolic Logic
  • 1995

The communication complexity of the threshold gates

  • N Nissan
  • Combinatorics, P. Erdd os is Eighty
  • 1993

Current address: Mathematical Institute 24-29 St.Giles' Oxford, OX1 3LB

  • Current address: Mathematical Institute 24-29 St…

Similar Papers

Loading similar papers…