Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Theory of computation → Oracles and decision trees"'
Given a Boolean formula ϕ over n variables, the problem of model counting is to compute the number of solutions of ϕ. Model counting is a fundamental problem in computer science with wide-ranging applications in domains such as quantified informati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::706ceb7e56e6b2cea327ae99044e47cc
http://arxiv.org/abs/2306.10281
http://arxiv.org/abs/2306.10281
The physically motivated quantum generalisation of k-SAT, the k-Local Hamiltonian (k-LH) problem, is well-known to be QMA-complete ("quantum NP"-complete). What is surprising, however, is that while the former is easy on 1D Boolean formulae, the latt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93c3daecdab7d3d316de721b7987dd8e
Autor:
Beame, Paul, Kornerup, Niels
Cumulative memory -- the sum of space used per step over the duration of a computation -- is a fine-grained measure of time-space complexity that was introduced to analyze cryptographic applications like password hashing. It is a more accurate cost m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b7cf9d6da80b77f8b886760afbb2795
We show that the deterministic decision tree complexity of a (partial) function or relation f lifts to the deterministic parity decision tree (PDT) size complexity of the composed function/relation f∘g as long as the gadget g satisfies a property t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f81bb9a889a5ab5dbad151eb3e96acc
http://arxiv.org/abs/2211.17214
http://arxiv.org/abs/2211.17214
The Aaronson-Ambainis conjecture (Theory of Computing '14) says that every low-degree bounded polynomial on the Boolean hypercube has an influential variable. This conjecture, if true, would imply that the acceptance probability of every $d$-query qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bff9c69df14c9faceb61b4359c0c528
https://doi.org/10.4230/lipics.ccc.2022.28
https://doi.org/10.4230/lipics.ccc.2022.28
Autor:
Chakraborty, Sourav, Chattopadhyay, Arkadev, H��yer, Peter, Mande, Nikhil S., Paraashar, Manaswi, de Wolf, Ronald
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}��� ��� {-1,1} and G ��� {AND���, XOR���}, the bounded-error quantum communication complexity of the composed function f���G e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98e82ef436c04bd2402dd9f62c1bb661
https://ir.cwi.nl/pub/31326
https://ir.cwi.nl/pub/31326
In this paper, we study testing decision tree of size and depth that are significantly smaller than the number of attributes n. Our main result addresses the problem of poly(n,1/��) time algorithms with poly(s,1/��) query complexity (independ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7874e3614395d42bad3badc550235338
We consider the following question in query complexity: Given a classical query algorithm in the form of a decision tree, when does there exist a quantum query algorithm with a speed-up (i.e., that makes fewer queries) over the classical one? We prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d6f45b21cd7824727df0b5c1be01114
We construct an oracle relative to which P = NP ∩ coNP, but there are no many-one complete sets in UP, no many-one complete disjoint NP-pairs, and no many-one complete disjoint coNP-pairs. This contributes to a research program initiated by Pudlák
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffb29ee0f8428f951d1fd80ae78b1c1d
Autor:
Beniamini, Gal
We obtain complete characterizations of the Unique Bipartite Perfect Matching function, and of its Boolean dual, using multilinear polynomials over the reals. Building on previous results [Beniamini, 2020; Beniamini and Nisan, 2021], we show that, su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11a55c18b42bff46678b2c5a0e74cac9