Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
351
search results - page 71 / 71
»
On the Learnability of Boolean Formulae
Sort
relevance
views
votes
recent
update
View
thumb
title
129
click to vote
FOCS
2007
IEEE
102
views
Theoretical Computer Science
»
more
FOCS 2007
»
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
15 years 9 months ago
Download
www.cims.nyu.edu
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
claim paper
Read More »
« Prev
« First
page 71 / 71
Last »
Next »