838 citations
- Microsoft Research (India)IN10 papers
- Indian Institute of Technology HyderabadIN8 papers
- Microsoft (United States)US6 papers
- Indian Institute of Technology KharagpurIN4 papers
- International Institute of Information Technology, HyderabadIN4 papers
- Carnegie Mellon UniversityUS3 papers
- Indian Institute of Technology DelhiIN3 papers
- Indraprastha Institute of Information Technology DelhiIN3 papers
- IBM Research - IndiaIN2 papers
- Indian Institute of Science BangaloreIN2 papers
- International Institute of Information TechnologyIN2 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
Learning sums of powers of low-degree polynomials in the non-degenerate case
Ankit Garg, Neeraj Kayal, Chandan Saha
We develop algorithms for writing a polynomial as sums of powers of low degree polynomials. Consider an -variate degree- polynomial which can be written as $$f = c_1Q_1^{…
cs.CC2011
Universal Computation Is 'Almost Surely' Chaotic
Nabarun Mondal, Partha P. Ghosh
Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as…