Sciweavers

1057 search results - page 166 / 212
» its 1998
Sort
View
CPC
1998
91views more  CPC 1998»
13 years 10 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický
DAM
1998
88views more  DAM 1998»
13 years 10 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
DM
1998
68views more  DM 1998»
13 years 10 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
ELECTRONICMARKETS
1998
150views more  ELECTRONICMARKETS 1998»
13 years 10 months ago
Services of A Broker in Electronic Commerce Transactions
AbstractAbstractAbstractAbstract Current Web-based electronic commerce systems are lacking in efficient electronic brokerage. However, brokerage plays an important role in many ele...
Martin Bichler, Carrie Beam, Arie Segev
GRAMMARS
1998
111views more  GRAMMARS 1998»
13 years 10 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai