Some extremal problems arising from discrete control processes
- 1 September 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (3) , 269-287
- https://doi.org/10.1007/bf02125896
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sourcesCombinatorica, 1987
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, 1986
- Ordered Ranked Posets, Representations of Integers and Inequalities from Extremal Poset ProblemsPublished by Springer Nature ,1985
- The bit extraction problem or t-resilient functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Unbiased bits from sources of weak randomness and probabilistic communication complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Collective coin flipping, robust voting schemes and minima of Banzhaf valuesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Random polynomial time is equal to slightly-random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Optimal numberings and isoperimetric problems on graphsJournal of Combinatorial Theory, 1966
- 12. The Number of Simplices in a ComplexPublished by University of California Press ,1963