|Introduction to Information-Based Complexity
Introduction to Information-Based Complexity
Traub, J. F.
|is based on three assumptions: information ...
|... by using block patters (BPs) of varying
|Properties of human visual memory for block patterns
Properties of human visual memory for block patterns
|and matrix size (n-by-n). ...
|... specify stimulus determinants of pattern
|Complexity and goodness of dot patterns varying in symmetry
Complexity and goodness of dot patterns varying in symmetry
Hamada, Jiro; Ishihara, Toru
|and pattern goodness. ...
|and order are easy to understand, but ...
|... environment of a given region affects the
|Resource Structure and Human Organization
Resource Structure and Human Organization
Bamforth, Douglas B.
|of human organization in that region. ...
|... h p . The top-down algorithm has bit
|Distributed algorithms for tree pattern matching
Distributed algorithms for tree pattern matching
Singh, Gurdip; Smolka, Scott A.; Ramakrishnan, I. V.
|O(n log m h p ) and time ...
|... The linear
|Linear complexity in coding theory
Linear complexity in coding theory
Massey, James L.; Schaub, Thomas
|of sequences is defined and its main ...
|... We investigate the
|On the complexity of queries in the logical data model
On the complexity of queries in the logical data model
Kuper, Gabriel M.; Vardi, Moshe Y.
|of query processing in the logical data ...
|... give is that it is about “dealing with
|Systems and Complexity
Systems and Complexity
Flood, Robert L.; Carson, Ewart R.
|.” This response, however, will leave most ...
|... The time
|Analysis of a class of algorithms for problems on trace languages
Analysis of a class of algorithms for problems on trace languages
Bertoni, A.; Goldwurm, M.; Sabadini, N.
|of a class of algorithms for problems on ...
|... in alternating computations. A new
|On the power of communication in alternating machines
On the power of communication in alternating machines
|measure — synchronization ...
|... The following issues in computational
|Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
Vazirani, Vijay V.; Yannakakis, Mihalis
|remain imprecisely understood: the ...
|... The degree of cognitive
|Cognitive simplicity in the Type A “coronary-prone” pattern
Cognitive simplicity in the Type A “coronary-prone” pattern
Ortega, Deems F.; Weinstein, Karen
|exhibited in the decision making of Type A ...
|... Summary We develop a
Pudlák, Pavel; Rödl, Vojtěch; Savický, Petr
|theory based on the concept of the graph ...
|... all sense systems, the sensitivity and
|Growth of the Brain
Growth of the Brain
Nelson, J. E.
|of perception and response increase ...
|... New lower bound of
|Probabilistic automata complexity of languages depends on language structure and error probability
Probabilistic automata complexity of languages depends on language structure and error probability
Ablayev, Farid M.
|for probabilistic automata with error ...
|... This paper concerns the message
|A tradeoff between information and communication in broadcast protocols
A tradeoff between information and communication in broadcast protocols
Awerbuch, Baruch; Goldreich, Oded; Peleg, David; Vainish, Ronen
|of broadcast in arbitrary point-to-point ...
|... Summary The biochemical
|Biochemical versatility of amphiploids derived from crossing Dasypyrum villosum Candargy and wheat: genetic control and phenotypical aspects
Biochemical versatility of amphiploids derived from crossing Dasypyrum villosum Candargy and wheat: genetic control and phenotypical aspects
Pace, C.; Montebove, L.; Delre, V.; Jan, C. C.; Qualset, C. O.; Scarascia Mugnozza, G. T.
|and its consequence has been investigated ...
|... The computation of the single level
|The conjunctive complexity of quadratic boolean functions
The conjunctive complexity of quadratic boolean functions
Lenz, Katja; Wegener, Ingo
|is shown to be NP complete. ...
|Multiplicative Complexity of Linear and Bilinear Systems
Multiplicative Complexity of Linear and Bilinear Systems
Heideman, Michael T.
|theory is a field that has existed for ...
|... consists of public transformations of
|Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption
Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption
Matsumoto, Tsutomu; Imai, Hideki
|O(m 2 n 3) and secret transformations of ...
|... for R that evaluates f has communication
|Randomized function evaluation on a ring
Randomized function evaluation on a ring
Abrahamson, Karl; Adler, Andrew; Higham, Lisa; Kirkpatrick, David
|Ω(n log n) bits. ...
|... matching problem, our algorithm has
|A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
Brezovec, Carl; Cornuéjols, Gérard; Glover, Fred
|O(|E∥V|+|V| 2log|V|). ...
|... yields an algorithm that has an average
|A select and insert sorting algorithm
A select and insert sorting algorithm
Beck, István; Krogdahl, Stein
|ofO(n 1.5) and a worst case ...
|... of alternations of the Turing machine. For
|Domino games with an application to the complexity of boolean algebras with bounded quantifier alternations
Domino games with an application to the complexity of boolean algebras with bounded quantifier alternations
|classes ATIME(T(n), A(n)) we find complete ...