Lovelace - PDFSEARCH.IO - Document Search Engine

Lovelace
Results: 343

#	Item
161	Frequently Asked Questions for the Merry Rose Tavern at Cheapside by Lord Kendrick Wayfarer (mka Tanner Lovelace) This document Add to Reading List Source URL: merryrose.atlantia.sca.org Language: English - Date: 2009-04-01 01:13:28 Spamming Computer-mediated communication Social information processing Electronic documents Internet forum Spam Mailing list Internet Email Computing
162	On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆ Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2008-10-14 11:56:16 Bipartite graph Parity Clique Matching Adjacency matrix Intersection graph Complete bipartite graph Graph Bipartite dimension Graph theory Mathematics NP-complete problems
163	On Graph Complexity S . J U K N A† Universit¨ at Frankfurt, Institut f¨ ur Informatik Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2009-01-04 06:50:40 Circuit complexity Computational complexity theory Complexity classes AC Clique Parity function Boolean circuit Matching Circuit Theoretical computer science Mathematics Graph theory
164	Circuits with Arbitrary Gates for Random Operators ∗ S. Jukna G. Schnitger Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2010-04-30 12:55:41 Circuit complexity Computational complexity theory AC Boolean circuit Circuit NC Matrix FO Arithmetic circuit complexity Theoretical computer science Applied mathematics Complexity classes
165	7. Sunflowers One of most beautiful results in extremal set theory is the so-called Sunflower Lemma discovered by Erd˝os and Rado[removed]asserting that in a sufficiently large uniform family, some highly regular config Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:26 Forcing Sunflower Logic Mathematics Set theory Combinatorics
166	26. Derandomization Given a randomized algorithm A, a natural approach towards derandomizing it is to find a method for searching the associated sample space Ω for a good point ω with respect to a given input instanc Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:25 Random variable Method of conditional probabilities Event Independence Expected value Randomized algorithm Probability space Probability theory Probability Mathematics
167	[removed]The Basic Method Proof of Claim[removed]Suppose not. Then for some v, v 0 ∈ A we have u + v = u0 + v 0 , and hence, v + v 0 = u + u0 . Let c, c0 be the vectors from C for which Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:28 Linear combination Projection Basis Dot product Vector space Euclidean vector Comparison of vector algebra and geometric algebra Euclidean subspace Algebra Mathematics Linear algebra
168	18.6 Cross-intersecting families 233 Proof. Let A be a set of r random 0-1 vectors of length n, each entry of which takes values 0 or 1 independently and with equal probability 1/2. For every Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:28 Cryptography Polynomials
169	4.2 The Erd˝ os–Szekeres theorem 39 We will be interested in the length of the longest increasing and decreasing Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:28 Elementary mathematics Dynamic programming Formal languages Longest increasing subsequence Subsequence Sequence Erdős–Szekeres theorem Mathematics Discrete mathematics Combinatorics
170	15.1 Orthogonality 193 Lemma[removed]Alon 1990a). Let vi = (vi1 , vi2 , . . . , vin ), 1 6 i 6 k, be k mutually orthogonal vectors, where vij ∈ {−1, +1}, and let c1 , c2 , . . . , ck be k Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:27 Matrices Design theory Hadamard matrix Coding theory Matrix Rank Matrix theory Hadamard code Butson-type Hadamard matrix Algebra Mathematics Linear algebra

UPDATE