Lower bound methods for multiparty communication complexity

Lower bound methods for multiparty communication complexity

Not available === text

Bibliographic Details
Main Author:	Ford, Jeffrey Stephen
Format:	Others
Language:	English
Published:	2008
Subjects:	Combinatorial analysis Tensor products Computational complexity
Online Access:	http://hdl.handle.net/2152/2455

Similar Items

Lower bounds for the number of pairwise orthogonal symmetric Latin squares /
by: Dinitz, Jeffrey H.,
Published: (1980)

Multiparty Communication Complexity
by: David, Matei
Published: (2010)

Multiparty Communication Complexity
by: David, Matei
Published: (2010)

Two new lower bounds for the minimum eigenvalue of M-tensors
by: Jianxing Zhao, et al.
Published: (2016-10-01)

Lower bounds in communication complexity and learning theory via analytic methods
by: Sherstov, Alexander Alexandrovich
Published: (2009)

Domination in graphs with bounded degrees
by: Dorfling, Samantha
Published: (2012)

Topics in computational complexity
by: Farr, Graham E.
Published: (1986)

Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
by: Papakonstantinou, Periklis
Published: (2010)

Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
by: Papakonstantinou, Periklis
Published: (2010)

On the parameterized complexity of finding short winning strategies in combinatorial games
by: Scott, Allan Edward Jolicoeur
Published: (2010)

Lower Bounds and Derandomization
by: Gardezi, Jaffer
Published: (2008)

Lower Bounds and Derandomization
by: Gardezi, Jaffer
Published: (2008)

Applications of Games to Propositional Proof Complexity
by: Hertel, Alexander
Published: (2008)

Applications of Games to Propositional Proof Complexity
by: Hertel, Alexander
Published: (2008)

Optimal Alignment of Multiple Sequence Alignments
by: Starrett, Dean
Published: (2008)

On the Complexity of Finding Spanner Paths
by: Nilsson, Mikael
Published: (2013)

Enumerative methods in combinatorial analysis
by: Abramson, Morton.
Published: (1966)

Simplicial Complexes of Placement Games
by: Huntemann, Svenja
Published: (2013)

A Note on Lower Bounds for Colourful Simplicial Depth
by: Antoine Deza, et al.
Published: (2013-01-01)

Combinatorial optimization on series-parallel graphs : algorithms and complexity
by: Richey, Michael Bruce
Published: (2008)

Topics in discrete optimization: models, complexity and algorithms
by: He, Qie
Published: (2014)

Combinatorics of Speech Etiquette Formulas in Communicative Situation “Response to Gratitude” in English Language
by: M. V. Vlavatskaya
Published: (2017-02-01)

The maximum clique problem - on finding an upper bound with application to protein structure alignment
by: Baamann, Katharina
Published: (2009)

Polyhedral studies on scheduling and routing problems
by: Wang, Yaoguang
Published: (2011)

Lower bounds for natural functions in restricted boolean circuits
by: Sengupta, Rimli
Published: (2006)

On the isomorphism testing of graphs
by: Sun, Xiaorui
Published: (2016)

An Improvement of the Lower Bound on the Minimum Number of ≤<i>k</i>-Edges
by: Javier Rodrigo, et al.
Published: (2021-03-01)

Computational Voting Theory: Game-Theoretic and Combinatorial Aspects
by: Xia, Lirong
Published: (2011)

Jump numbers, hyperrectangles and Carlitz compositions
by: Cheng, Bo
Published: (2014)

Parameterized algorithms and computational lower bounds: a structural approach
by: Xia, Ge
Published: (2006)

A new S-type upper bound for the largest singular value of nonnegative rectangular tensors
by: Jianxing Zhao, et al.
Published: (2017-05-01)

Comparison of Cylindrical Boundary Pasting Methods
by: Aggarwal, Shalini
Published: (2006)

Comparison of Cylindrical Boundary Pasting Methods
by: Aggarwal, Shalini
Published: (2006)

Autocorrelation and decomposition methods in combinational logic design
by: Tomczuk, Randal Wade
Published: (2018)

On a New type of Tensor on Real Hypersurfaces in Non-Flat Complex Space Forms
by: George Kaimakamis, et al.
Published: (2019-04-01)

Maximal (0,1,2,...t)-cliques of some association schemes /
by: Choi, Sul-young
Published: (1985)

The structure of the solution space and its relation to execution time of evolutionary algorithms with applications
by: Ghannadian, Farzad
Published: (2007)

On the Hadamard theorem and maximal determinants in combinatorial investigations

A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
by: Daniel Khoshnoudirad
Published: (2015-09-01)

Combinatorial displays
by: Hajdú, Péter, 1923-
Published: (1974)