Zobrazeno 1 - 10
of 15 949
pro vyhledávání: '"Complexity classes"'
Autor:
Thapen, Neil
Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to an object
Externí odkaz:
http://arxiv.org/abs/2412.09984
Autor:
Delavenne, Hugo, Gall, François Le
This work investigates the relationships between quantum state synthesis complexity classes (a recent concept in computational complexity that focuses on the complexity of preparing quantum states) and traditional decision complexity classes. We espe
Externí odkaz:
http://arxiv.org/abs/2407.02907
Since their appearance in the 1950s, computational models capable of performing probabilistic choices have received wide attention and are nowadays pervasive in almost every areas of computer science. Their development was also inextricably linked wi
Externí odkaz:
http://arxiv.org/abs/2409.11999
With the developments in machine learning, there has been a surge in interest and results focused on algorithms utilizing predictions, not least in online algorithms where most new results incorporate the prediction aspect for concrete online problem
Externí odkaz:
http://arxiv.org/abs/2406.18265
Autor:
Porreca, Antonio E.
Many unconventional computing models, including some that appear to be quite different from traditional ones such as Turing machines, happen to characterise either the complexity class P or PSPACE when working in deterministic polynomial time (and in
Externí odkaz:
http://arxiv.org/abs/2405.16896
Fagin's seminal result characterizing $\mathsf{NP}$ in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative (weighted)
Externí odkaz:
http://arxiv.org/abs/2404.17784
Autor:
Coppola, Gregory
Given the emergent reasoning abilities of large language models, information retrieval is becoming more complex. Rather than just retrieve a document, modern information retrieval systems advertise that they can synthesize an answer based on potentia
Externí odkaz:
http://arxiv.org/abs/2402.18566
Autor:
Hatami, Hamed, Hatami, Pooya
Several theorems and conjectures in communication complexity state or speculate that the complexity of a matrix in a given communication model is controlled by a related analytic or algebraic matrix parameter, e.g., rank, sign-rank, discrepancy, etc.
Externí odkaz:
http://arxiv.org/abs/2401.14623
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.