Le cluster communication - modular

Terms

7	communication
2	modular
2	bounds
13	complexity
2	computational

Associations

Freq.	Weight	Association
2	0.535	communication - modular
2	0.535	bounds - communication
4	0.419	communication - complexity
2	0.392	complexity - computational
2	0.392	bounds - complexity

Documents par ordre de pertinence

000219 (2001)	Jürgen Forster [Allemagne] ; Matthias Krause [Allemagne] ; Satyanarayana V. Lokam [États-Unis] ; Rustam Mubarakzjanov [Allemagne] ; Niels Schmitt [Allemagne] ; Hans Ulrich Simon [Allemagne]	Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
000270 (1996)	Christoph Meinel [Allemagne] ; Stephan Waack	The “log rank” conjecture for modular communication complexity
000271 (1996)	Carsten Damm [Allemagne] ; Stasys Jukna [Allemagne] ; Ji Sgall [République tchèque]	Some bounds on multiparty communication complexity of pointer jumping
000288 (1995)	Christoph Meinel [Allemagne] ; Stephan Waack	Lower bounds for the majority communication complexity of various graph accessibility problems
000249 (1998)	Carsten Damm [Allemagne]	On Boolean vs. Modular arithmetic for circuits and communication protocols
000256 (1997)	J. Bern [Allemagne] ; C. Damm [Allemagne] ; Ch Meinel [Allemagne]	The electronic colloquium on computational complexity (ECCC): A digital library in use
000031 (2009)	Gábor Erdélyi [Allemagne] ; Henning Fernau [Allemagne] ; Judy Goldsmith [États-Unis] ; Nicholas Mattei [États-Unis] ; Daniel Raible [Allemagne] ; Jörg Rothe [Allemagne]	The Complexity of Probabilistic Lobbying
000053 (2008)	Tina Mattes [Allemagne] ; Frank Schiller [Allemagne] ; Annemarie Mörwald [Allemagne] ; Thomas Honold [République populaire de Chine]	Analysis of Nested CRC with Additional Net Data in Communication
000086 (2005)	Karsten Böhm [Allemagne] ; Alexander Scherf [Allemagne]	Using Digital Communication Structures to Support Knowledge Management
000212 (2002)	Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne]	Automatic Complexity Analysis
000220 (2001)	Michael R. Fellows [Australie]	Parameterized Complexity: The Main Ideas and Some Research Frontiers
000229 (2000)	Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne]	Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
000257 (1997)	Martin Mundhenk [Allemagne] ; Judy Goldsmith [États-Unis] ; Eric Allender [États-Unis]	The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
000294 (1994)	Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne]	On the complexity of constructing optimal ordered binary decision diagrams
000298 (1993)	Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne]	Separating complexity classes related to bounded alternating Ω-branching programs
000300 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	On the complexity of scheduling incompatible jobs with unit-times

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024