Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Shyan Akmal"'
Publikováno v:
Algorithmica.
In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78ee25e22487115d13978b5b0ed935e2
https://doi.org/10.1007/s00453-023-01102-6
https://doi.org/10.1007/s00453-023-01102-6
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 29:22-30
Controllability for Simple Temporal Networks with Uncertainty (STNUs) has thus far been limited to three levels: strong, dynamic, and weak. Because of this, there is currently no systematic way for an agent to assess just how far from being controlla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84b1f1abbf601aa1fd250551541fb21c
https://doi.org/10.1609/icaps.v29i1.3456
https://doi.org/10.1609/icaps.v29i1.3456
Autor:
Shyan Akmal, Ryan Williams
Majority-SAT is the problem of determining whether an input $n$-variable formula in conjunctive normal form (CNF) has at least $2^{n-1}$ satisfying assignments. Majority-SAT and related problems have been studied extensively in various AI communities
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bdbdaaaa5aa182017328b7ff12f1f63
http://arxiv.org/abs/2107.02748
http://arxiv.org/abs/2107.02748
Autor:
Shyan Akmal, Ce Jin
We study quantum algorithms for several fundamental string problems, including Longest Common Substring, Lexicographically Minimal String Rotation, and Longest Square Substring. These problems have been widely studied in the stringology literature si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c6d1084c1d329de135c08163ade9692
Publikováno v:
Artificial Intelligence. 289:103384
Controllability for Simple Temporal Networks with Uncertainty (STNUs) has thus far been limited to three levels: strong, dynamic, and weak. Because of this, there is currently no systematic way for an agent to assess just how far from being controlla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db8322c7b5b25638986638a9af1295d1
https://doi.org/10.1016/j.artint.2020.103384
https://doi.org/10.1016/j.artint.2020.103384
Publikováno v:
Optimization Letters. 9:1039-1052
A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38590bd3dd8552e499bd8ab6b837de4d
https://doi.org/10.1007/s11590-015-0847-x
https://doi.org/10.1007/s11590-015-0847-x