#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1993

2019

- This year (7)
- Last 5 years (20)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Amey Bhangale, Swastik Kopparty
- ArXiv
- 2015

We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability… (More)

- Amey Bhangale
- Electronic Colloquium on Computational Complexity
- 2018

We give very short and simple proofs of the following statements: Given a 2-colorable 4-uniform hypergraph on n vertices, 1. It is NP-hard to color it with log n colors for some δ > 0. 2. It is… (More)

- Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
- APPROX-RANDOM
- 2015

A recent result of Moshkovitz \cite{Moshkovitz14} presented an ingenious method to provide a completely elementary proof of the Parallel Repetition Theorem for certain projection games via a… (More)

- Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
- SIAM J. Discrete Math.
- 2017

We study the following basic problem called Bi-Covering. Given a graph $G(V,E)$, find two (not necessarily disjoint) sets $A\subseteq V$ and $B\subseteq V$ such that $A\cup B = V$ and such that every… (More)

- Amey Bhangale, Irit Dinur, Inbal Livni Navon
- ITCS
- 2016

We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a "cubes table" which assigns to every cube a low degree… (More)

- Per Austrin, Amey Bhangale, Aditya Potukuchi
- ArXiv
- 2018

A rainbow $q$-coloring of a $k$-uniform hypergraph is a $q$-coloring of the vertex set such that every hyperedge contains all $q$ colors.
We prove that given a rainbow $(k - 2\lfloor… (More)

- Per Austrin, Amey Bhangale, Aditya Potukuchi
- Electronic Colloquium on Computational Complexity
- 2019

We reprove the results on the hardness of approximating hypergraph coloring using a different technique based on bounds on the size of extremal $t$-agreeing families of $[q]^n$. Specifically, using… (More)

- Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
- Electronic Colloquium on Computational Complexity
- 2014

Given $k$ collections of 2SAT clauses on the same set of variables $V$, can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such simultaneous… (More)

- Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari
- FSTTCS
- 2017

A Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is called a dictator if it depends on exactly one variable i.e $f(x_1, x_2, \ldots, x_n) = x_i$ for some $i\in [n]$. In this work, we study a… (More)

We study the following basic problem called Bi-Covering. Given a graph G(V, E), find two (not necessarily disjoint) sets A subseteq V and B subseteq V such that A union B = V and that every edge e… (More)