Search results

...Cite journal | doi = 10.1145/1044731.1044732| title = Approximate distance oracles| journal = Journal of the ACM| volume = 52| pages = 1–24| year = 2005| last ...name=pr10>{{Cite conference| doi = 10.1109/FOCS.2010.83| title = Distance Oracles beyond the Thorup–Zwick Bound| conference = 2010 IEEE 51st Annual Symposium ...

...decline of CBC-mode cipher suites |url=https://blog.cloudflare.com/padding-oracles-and-the-decline-of-cbc-mode-ciphersuites |website=The Cloudflare Blog |lang ...e into an encryption oracle, and is primarily demonstrated against padding oracles. ...

...COH applies a [[Padding (cryptography)|padding]] function. Assuming random oracles, finding a [[Collision resistance|collision]] in MuHASH implies solving the ECOH does not use random oracles and its security is not strictly directly related to the discrete logarithm ...

...x set]] that is given as an input to an optimization algorithm. Separation oracles are used as input to [[Ellipsoid method|ellipsoid methods]].<ref name=":0" [[Category:Computation oracles]] ...

...lso been used; some of them have been shown to be weaker than independence oracles, some stronger, and some equivalent in computational power.<ref name="Robin ==Use of oracles== ...

...enumeration reducibility]] with enumerability relative to [[oracle machine|oracles]]. It is named after [[Alan Selman]], who proved it as part of his PhD thes [[Category:Theorems in theory of computation]] ...

...imated arbitrarily closely in sublinear time, given access to the shape by oracles for finding an extreme point in a given direction and for finding the inter ...ary smoothly within each cell. They thus reduce the problem to a numerical computation within each cell, which they do not solve explicitly. The partition of the ...

...ional complexity theory]], the '''decision tree model''' is the [[model of computation]] in which an [[algorithm]] can be considered to be a [[decision tree]], i. ...sium on Theory of computing - STOC '83 |chapter=Lower bounds for algebraic computation trees |date=1983-12-01|location=New York, NY, USA|publisher=Association for ...

== Computation == ...first2=Walter |last3=Kuipers |first3=Jeroen |date=2001-09-01 |title=On the computation of the nucleolus of a cooperative game |url=https://doi.org/10.1007/s001820 ...

...ensitive Automated Market Maker |journal=ACM Transactions on Economics and Computation |volume=1 |date=Sep 2013 |issue=3 |pages=1–25 |doi=10.1145/2509413.2509414 ...M Conference on Advances in Financial Technologies |chapter=Improved Price Oracles: Constant Function Market Makers |date=26 October 2020 |pages=80–91 |doi=10 ...

...=Blum | first1=Manuel | last2=Impagliazzo | first2=Russell | title=Generic oracles and oracle classes | book-title=28th Annual Symposium on Foundations of Com * {{cite book | last=Simon | first=Hans-Ulrich | title=Foundations of Computation Theory | chapter=A tight Ω(loglog n)-bound on the time for parallel Ram's t ...

...e realistic model of computation is the [[RAM model]]. In the RAM model of computation, there is a [[CPU]] that can execute the basic mathematical, logical, and c ...Ostrovsky|first=Rafail|author-link=Rafail Ostrovsky|contribution=Efficient computation on oblivious RAMs|doi=10.1145/100216.100289|pages=514–523|publisher=[[Assoc ...

...e with <math>2^{n+1}</math>such oracles, and at least <math>2^{n-4}</math> oracles are needed unless P=NP. With additive utilities, it is NP-hard even for '' ...283.pdf|conference=Proceedings of the 2016 ACM Conference on Economics and Computation - EC '16|pages=305|doi=10.1145/2940716.2940726|isbn=9781450339360}}</ref> ...

| title = Independence and port oracles for matroids, with an application to computational learning theory | journal = Information and Computation ...

# Defining the oracles <math>U_C(\gamma)= \exp(-\imath \gamma H_C)</math> and <math>U_M(\alpha)= \ # Repeated application of the oracles <math>U_C</math> and <math>U_M</math>, in the order: <math>U(\boldsymbol\ga ...