The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

Source URL: ciim.usf.edu

A self-applicable partial evaluator for a subset of Haskell Silvano Dal-Zilio

Source URL: repository.readscheme.org

OWL3 Cheat Sheet This "cheat sheet" is a subset of the new words added to OTCWL2014 (aka OWL3), effective 10 April 2015 for club and tournament play. New Twos (4) DA

Source URL: www.seattlescrabble.org

Two-dimensional Subset Selection for Hypervolume and Epsilon-Indicator Karl Bringmann Tobias Friedrich

Source URL: people.mpi-inf.mpg.de

1. Metrically approximate subgroups Let G be a group with a metric d invariant under left and right translations. A (K, r)-approximate subgroup is a subset X of G containing 1, such that the product set XX is covered by

Source URL: www.ma.huji.ac.il

We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempefrom the setting of linear regression to arbitrary objective functions. This connection allows

Source URL: mmds-data.org

Worksheet on Inclusion-Exclusion October 11, 2015 This is a long worksheet and it will probably span two days. Might I suggest that you refrain from working on it between the classes so you can enjoy the discovery collab

Source URL: math.colorado.edu

• Mathematics
• Enumerative combinatorics
• Probability theory
• Mathematical proofs
• Inclusionexclusion principle
• Combinatorial proof
• Wallet
• Combinatorics
• Subset
• Combinatory logic
• FO

SETS: A Basic Set Theory Package Francis J. Wright School of Mathematical Sciences Queen Mary and Westfield College University of London Mile End Road, London E1 4NS, UK.

Source URL: reduce-algebra.com

• Mathematical logic
• Mathematics
• Logic
• Boolean algebra
• Predicate logic
• Relational operator
• Predicate
• Boolean data type
• Algebra of sets
• Subset
• Equality
• Logical disjunction

In this talk, I will discuss Ligra, a shared-memory graph processing framework that has two very simple routines, one for mapping over edges and one for mapping over vertices. The routines can be applied to any subset of

Source URL: mmds-data.org

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Source URL: web.stanford.edu

• Mathematics
• Search algorithms
• Information retrieval
• Information science
• Hashing
• Analysis of algorithms
• Cryptographic hash functions
• Computational complexity theory
• Universal hashing
• Hash function
• Randomized algorithm
• Subset sum problem