Yuval

Results: 343



#Item
231NP-complete problems / Matroid theory / Operations research / Submodular set function / Matroid / Greedy algorithm / Set cover problem / Linear programming / Algorithm / Mathematics / Theoretical computer science / Applied mathematics

The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-12-02 06:14:39
232Character encoding / Physics / Mathematics / Fourier analysis / Fourier transform / Joseph Fourier

Friedgut–Kalai–Naor theorem for slices of the Boolean cube Yuval Filmus˚ Institute for Advanced Study, Princeton, NJ October 15, 2014 Abstract

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-10-15 11:15:14
233Mathematics / Homogeneous polynomial / Representation theory / Entailment / Monomial order / Algebra / Abstract algebra / Polynomials

On the Alekhnovich–Razborov degree lower bound Yuval Filmus∗ October 17, 2014 1

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-10-17 02:14:03
234Submodular set function / Order theory / Matroid / Linear programming / Greedy algorithm / XTR / Monotonic function / Greedoid / Ordinal optimization / Mathematics / Mathematical analysis / Matroid theory

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-11-25 12:04:59
235Combinatorics / Fourier analysis / Fourier series / Theorem / Erdős–Ko–Rado theorem / Mathematics / Logic / Joseph Fourier

Spectral Methods in Extremal Combinatorics by Yuval Filmus

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-01-06 05:41:41
236Order theory / Supermodular function / Forcing / Mathematics / Submodular set function / Function

Inequalities on Submodular Functions via Term Rewriting Yuval Filmusa,1,∗ a University of Toronto

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2013-03-30 16:29:36
237Computational complexity theory / Logic in computer science / Mathematical logic / Proof theory / Automated theorem proving / Frege system / Proof complexity / Function / Switching lemma / Theoretical computer science / Mathematics / Logic

A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-04-05 15:13:04
238Logic / Logic in computer science / Propositional calculus / Rules of inference / Logic programming / Resolution / Conjunctive normal form / Unit propagation / Proof complexity / Theoretical computer science / Automated theorem proving / Mathematical logic

From Small Space to Small Width in Resolution Yuval Filmus1 , Massimo Lauria2 , Mladen Mikša2 , Jakob Nordström2 , and Marc Vinyals2 1 2

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-01-09 15:51:16
239Integral transforms / Unitary operators / Digital signal processing / Fourier transform / Fourier series / Mathematical analysis / Joseph Fourier / Fourier analysis

Triangle-Intersecting Families of Graphs David Ellis1 Yuval Filmus2 Ehud Friedgut3 1

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-05-07 09:37:35
240Applied mathematics / Context-free grammar / Regular language / Constructible universe / Formal grammar / Controlled grammar / Theorems and definitions in linear algebra / Formal languages / Mathematics / Theoretical computer science

Lower Bounds for Context-Free Grammars Yuval Filmusa,1,∗ a University of Toronto

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2015-04-19 22:24:10
UPDATE