Search results for TOPOLOGICAL LOWER BOUNDS FOR ARITHMETIC - opus.bath.ac.uk/51147/1/ LOWER BOUNDS FOR ARITHMETIC NETWORKS ANDREI GABRIELOV AND NICOLAI VOROBJOV ... closed sets, Borel-Moore and singular

TOPOLOGICAL LOWER BOUNDS FOR ARITHMETIC NETWORKS ANDREI GABRIELOV AND NICOLAI VOROBJOV Abstract. We prove that the depth of any arithmetic network for deciding membership…

Lower Bounds for Succinct Data Structures Dynamic Lower Bounds Mihai Pătrașcu What can binary trees do? maintain aggregates over a static structure insert and delete nodes…

Tight Bounds for Dynamic Convex Hull Queries (Again) Lower Bounds for 2-Dimensional Range Counting Mihai Pătraşcu summer @ Range Counting SELECT count(*) FROM employees…

matching.dviMatching Principles Institute for Advanced Study, Princeton, US and Steklov Mathematical Institute, Moscow, Russia Abstract For an arbitrary hypergraph H, let

Ilan Komargodski∗ Ran Raz∗ Abstract We give an explicit function h : {0, 1}n → {0, 1} such that any deMorgan formula of size O(n2.499) agrees with h on

Yair Carmon John C. Duchi Oliver Hinder Aaron Sidford {yairc,jduchi,ohinder,sidford}@stanford.edu Abstract We prove lower bounds on the complexity of finding ε-stationary

Elusive Functions and Lower Bounds for Arithmetic Circuits Ran Raz∗ Weizmann Institute Abstract A basic fact in linear algebra is that the image of the curve fx = x1 x2…

Lower Bounds for Data Structures Mihai Pătrașcu 2nd Barriers Workshop Aug 29 ’10 Model of Computation Word = w-bit integer Memory = array of S words Unit-time operations…

Improved Average-Case Lower Bounds for DeMorgan Formula Size Matching Worst-Case Lower Bound Ilan Komargodski∗ Ran Raz∗ Avishay Tal∗ Abstract We give a function h :…

Information Complexity Lower Bounds for Data Streams David Woodruff IBM Almaden Last time: 1-Way Communication of Index Alice has x 2 {0,1}n Bob has i 2 [n] Alice sends a…

Unprovability of Lower Bounds on Circuit Size in Certain Fragments of Bounded Arithmetic Alexander A. Razborov∗ School of Mathematics Institute for Advanced Study Princeton,…

The real τ-conjecture & lower bounds for the permanent Bruno Grenet LIP  ÉNS de Lyon Rencontres CoA  22 novembre 2012 Arithmetic Circuits f (x , y , z) = x4…

Lower bounds for Gromov width of coadjoint orbits in SO(n). Milena Pabiniak UIUC December 6, 2011 Problem suggested by prof Yael Karshon, extension of PhD work of her student…

Slide 1Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes Kenji Obata Slide 2 Codes Error correcting code C : {0,1} n {0,1} m with decoding procedure A s.t.…

Slide 1How to Grow Your Lower Bounds Mihai P ă trașcu Tutorial, FOCS’10 Slide 2 A Personal Story MIT freshman, 2002 … half year and no solution later What problem could…

Lower bounds for Gromov width of coadjoint orbits of U(n) and SO(n). Milena Pabiniak ETH, January 11th 2012 Problem suggested by prof Yael Karshon, extension of PhD work…

Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits Noga Alon∗ Mrinal Kumar† Ben Lee Volk‡ Abstract We prove a lower…

Slide 1Lower bounds for epsilon-nets Gabriel Nivasch Presenting work by: Noga Alon, János Pach, Gábor Tardos Slide 2 Epsilon-nets Let R be a family of ranges. Say, R =…

A LOWER BOUND FOR THE VARIANCE OF GENERALIZED DIVISOR FUNCTIONS IN ARITHMETIC PROGRESSIONS DANIELE MASTROSTEFANO Abstract We prove that for a large class of multiplicative…

Some Lower Bounds on Geometric Separability Problems∗ Esther M. Arkin† Ferran Hurtado‡ Joseph S. B. Mitchell§ Carlos Seara¶ Steven S. Skiena‖ December 31, 2005…