Zobrazeno 1 - 10
of 199
pro vyhledávání: '"P. S. Karthik"'
Parameterized Inapproximability Hypothesis (PIH) is a central question in the field of parameterized complexity. PIH asserts that given as input a 2-CSP on $k$ variables and alphabet size $n$, it is W[1]-hard parameterized by $k$ to distinguish if th
Externí odkaz:
http://arxiv.org/abs/2407.08917
In the Euclidean $k$-means problems we are given as input a set of $n$ points in $\mathbb{R}^d$ and the goal is to find a set of $k$ points $C\subseteq \mathbb{R}^d$, so as to minimize the sum of the squared Euclidean distances from each point in $P$
Externí odkaz:
http://arxiv.org/abs/2405.13877
Autor:
Bhattacharjee, Bishwaranjan, Trivedi, Aashka, Muraoka, Masayasu, Ramasubramanian, Muthukumaran, Udagawa, Takuma, Gurung, Iksha, Pantha, Nishan, Zhang, Rong, Dandala, Bharath, Ramachandran, Rahul, Maskey, Manil, Bugbee, Kaylin, Little, Mike, Fancher, Elizabeth, Gerasimov, Irina, Mehrabian, Armin, Sanders, Lauren, Costes, Sylvain, Blanco-Cuaresma, Sergi, Lockhart, Kelly, Allen, Thomas, Grezes, Felix, Ansdell, Megan, Accomazzi, Alberto, El-Kurdi, Yousef, Wertheimer, Davis, Pfitzmann, Birgit, Ramis, Cesar Berrospi, Dolfi, Michele, de Lima, Rafael Teixeira, Vagenas, Panagiotis, Mukkavilli, S. Karthik, Staar, Peter, Vahidinia, Sanaz, McGranaghan, Ryan, Lee, Tsendgar
Large language models (LLMs) trained on general domain corpora showed remarkable results on natural language processing (NLP) tasks. However, previous research demonstrated LLMs trained using domain-focused corpora perform better on specialized tasks
Externí odkaz:
http://arxiv.org/abs/2405.10725
Autor:
S., Karthik C., Rahul, Saladi
In this work, we present a plethora of results for the range longest increasing subsequence problem (Range-LIS) and its variants. The input to Range-LIS is a sequence $\mathcal{S}$ of $n$ real numbers and a collection $\mathcal{Q}$ of $m$ query range
Externí odkaz:
http://arxiv.org/abs/2404.04795
The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq \mathbb{N}$, such th
Externí odkaz:
http://arxiv.org/abs/2401.17235
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
Autor:
S., Karthik C., Manurangsi, Pasin
The field of combinatorial reconfiguration studies search problems with a focus on transforming one feasible solution into another. Recently, Ohsaka [STACS'23] put forth the Reconfiguration Inapproximability Hypothesis (RIH), which roughly asserts th
Externí odkaz:
http://arxiv.org/abs/2312.17140
Autor:
Sudha, R, Usha Devi A, H, Akshata Shenoy, S, Karthik H, Talath, Humera, P, Govindaraja B, K, Rajagopal A
We explore the entanglement features of pure symmetric N-qubit states characterized by N-distinct spinors with a particular focus on the Greenberger-Horne-Zeilinger(GHZ) states and WWbar, an equal superposition of W and obverse W states. Along with a
Externí odkaz:
http://arxiv.org/abs/2312.06369
Autor:
Ransome, Conor L., Villar, V. Ashley, Tartaglia, Anna, Gonzalez, Sebastian Javier, Jacobson-Galán, Wynn V., Kilpatrick, Charles D., Margutti, Raffaella, Foley, Ryan J., Grayling, Matthew, Ni, Yuan Qi, Yarza, Ricardo, Ye, Christine, Auchettl, Katie, de Boer, Thomas, Chambers, Kenneth C., Coulter, David A., Drout, Maria R., Farias, Diego, Gall, Christa, Gao, Hua, Huber, Mark E., Ibik, Adaeze L., Jones, David O., Khetan, Nandita, Lin, Chien-Cheng, Politsch, Collin A., Raimundo, Sandra I., Rest, Armin, Wainscoat, Richard J., Yadavalli, S. Karthik, Zenati, Yossef
The nearby type II supernova, SN2023ixf in M101 exhibits signatures of early-time interaction with circumstellar material in the first week post-explosion. This material may be the consequence of prior mass loss suffered by the progenitor which possi
Externí odkaz:
http://arxiv.org/abs/2312.04426
In the Max-k-diameter problem, we are given a set of points in a metric space, and the goal is to partition the input points into k parts such that the maximum pairwise distance between points in the same part of the partition is minimized. The appro
Externí odkaz:
http://arxiv.org/abs/2312.02097
In the Euclidean Steiner Tree problem, we are given as input a set of points (called terminals) in the $\ell_2$-metric space and the goal is to find the minimum-cost tree connecting them. Additional points (called Steiner points) from the space can b
Externí odkaz:
http://arxiv.org/abs/2312.01252