... investigation of cornrnunication |
complexity
Boolean Circuits Boolean Circuits Hromkovič, Juraj |
in Chapter 2 in order to give lower bounds ... |
... several applications of communication |
complexity
Sequential Computations Sequential Computations Hromkovič, Juraj |
for proving lower bounds on parallel ... |
... We take a fresh look at CD |
complexity
Resource-bounded kolmogorov complexity revisited Resource-bounded kolmogorov complexity revisited Buhrman, Harry; Fortnow, Lance |
, where CD t (x) is the smallest program ... |
... In this chapter we study the linear |
complexity
Linear Complexity Linear Complexity Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad Amin |
of a matrix A, which is the minimum number ... |
... The notion of instance |
complexity
NP-hard sets have many hard instances NP-hard sets have many hard instances Mundhenk, Martin |
was introduced by Ko, Orponen, Schöning, ... |
... and hardware systems with enormous |
complexity
Complexity Management: A Major Issue for Telecommunications Complexity Management: A Major Issue for Telecommunications Messerschmitt, David G. |
. ... |
... For all |
complexity
Effects of Kolmogorov complexity present in inductive inference as well Effects of Kolmogorov complexity present in inductive inference as well Ambainis, Andris; Apsītis, Kalvis; Calude, Cristian; Freivalds, Rūsiņš; Karpinski, Marek; Larfeldt, Tomas; Sala, Iveta; Smotrovs, Juris |
measures in Kolmogorov ... |
... ends, site frequency, enzyme class, and |
complexity
MAPDRAW MAPDRAW Plasterer, Thomas N. |
and manual selection. ... |
... The communication |
complexity
Communication complexity and sequential computation Communication complexity and sequential computation Hromkovič, Juraj; Schnitger, Georg |
of two-party protocols introduced by ... |
... The most of the previous work on the |
complexity
Two lower bounds on computational complexity of infinite words Two lower bounds on computational complexity of infinite words Hromkovič, Juraj; Karhumäki, Juhani |
of infinite words has measured the ... |
... specific polynomials of provably high |
complexity
Specific Polynomials which Are Hard to Compute Specific Polynomials which Are Hard to Compute Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad Amin |
which originate in a landmark paper by ... |
... resource-bounded version in computational |
complexity
Resource-Bounded Complexity Resource-Bounded Complexity Li, Ming; Vitányi, Paul |
theory. ... |
... is one of the central tasks of |
complexity
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations Ďuriš, Pavol; Hromkovič, Juraj; Rolim, José D. P.; Schnitger, Georg |
theory. ... |
... molecular weight of a nucleotide, C is the |
complexity
Subtractive cDNA Cloning Using Magnetic Beads and PCR Subtractive cDNA Cloning Using Magnetic Beads and PCR Coche, Thierry G. |
of the collection of sequences (number of ... |
... that P-completeness implies high parallel |
complexity
Parallel vs. parametric complexity Parallel vs. parametric complexity Mulmuley, Ketan |
, and for the P ≠ NC conjecture itself. ... |
... is intuitively complex. Intuitions about |
complexity
Complexity formalisms, order and disorder in the structure of art Complexity formalisms, order and disorder in the structure of art Davis, Mark W. |
can be used as a basis for developing a ... |
... depends primarily on the mould |
complexity
Artificial neural network based model for computation of injection mould complexity Artificial neural network based model for computation of injection mould complexity Raviwongse, Rawin; Allada, Venkat |
. ... |
... Measures of |
complexity
Complexity and Diversity — An Introduction Complexity and Diversity — An Introduction Nakamura, E. R.; Kudo, K. |
hitherto proposed are classified into two, ... |
... We obtain a formula for the subword |
complexity
The subword complexity of fixed points of binary uniform morphisms The subword complexity of fixed points of binary uniform morphisms Frid, Anna E. |
of every binary DOL word which is a fixed ... |
... discourse coding systems (i.e., a text |
complexity
Appendix: Political Discourse in Adolescents with Their Mothers Appendix: Political Discourse in Adolescents with Their Mothers Young, Gerald |
measure which examines the cognitive ... |
... information effectively reduces the |
complexity
Generalization of the PAC-model for learning with partial information Generalization of the PAC-model for learning with partial information Ratsaby, Joel; Maiorov, Vitaly |
of the hypothesis class used to learn the ... |
... It has the available processor steps |
complexity
Performing tasks on restartable message-passing processors Performing tasks on restartable message-passing processors Chlebus, Bogdan S.; Prisco, Roberto; Shvartsman, Alex A. |
S = O((t + plog p/ log log p) · log f) and ... |
... The theory of computation and |
complexity
Complexity: A Language-Theoretic Point of View Complexity: A Language-Theoretic Point of View Calude, Cristian; Hromkovič, Juraj |
theory are fundamental parts of current ... |
... this was not only of importance for the |
complexity
Introduction Introduction Jansen, Benjamin |
theory of LP, it also had important ... |
... it discusses what constitutes project |
complexity
The Need for New Paradigms for Complex Projects The Need for New Paradigms for Complex Projects Williams, T. M. |
. ... |