<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/a_olympia/the"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/a_olympia/the</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20160caf3b6781944fb6069b8bf74cf61/a_olympia"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20160caf3b6781944fb6069b8bf74cf61/a_olympia"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs.LO/0610117"/><swrc:date>Sat Aug 18 13:22:24 CEST 2007</swrc:date><swrc:month>Oct</swrc:month><swrc:title>Quantifier elimination for the reals with a predicate for the powers of two</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>elimination for of powers predicate quantifier reals the two </swrc:keywords><swrc:abstract>In 1985, van den Dries showed that the theory of the reals with a predicate
for the integer powers of two admits quantifier elimination in an expanded
language, and is hence decidable. He gave a model-theoretic argument, which
provides no apparent bounds on the complexity of a decision procedure. We
provide a syntactic argument that yields a procedure that is primitive
recursive, although not elementary. In particular, we show that it is possible
to eliminate a single block of existential quantifiers in time $2^0_{O(n)}$,
where $n$ is the length of the input formula and $2_k^x$ denotes $k$-fold
iterated exponentiation.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="908314" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="cs.LO/0610117" swrc:key="eprint"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jeremy Avigad"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Yimu Yin"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/26dd13a52424aa438d7ec60c4d1dd0cb2/a_olympia"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26dd13a52424aa438d7ec60c4d1dd0cb2/a_olympia"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://portal.acm.org/citation.cfm?id=359563"/><swrc:date>Sat Aug 18 13:22:24 CEST 2007</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>Commun. ACM</swrc:journal><swrc:month>July</swrc:month><swrc:number>7</swrc:number><swrc:pages>558--565</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM Press"/></swrc:publisher><swrc:title>Time, clocks, and the ordering of events in a distributed system</swrc:title><swrc:volume>21</swrc:volume><swrc:year>1978</swrc:year><swrc:keywords>and clocks distributed events ordering system the time </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0001-0782" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="384502" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1145/359545.359563" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Leslie Lamport"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e2035129c70fbaed47ffb31214e5411d/a_olympia"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e2035129c70fbaed47ffb31214e5411d/a_olympia"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><owl:sameAs rdf:resource="http://www.amazon.ca/exec/obidos/redirect?tag=citeulike04-20{\&amp;}path=ASIN/0393324427"/><swrc:date>Sat Aug 18 13:22:24 CEST 2007</swrc:date><swrc:howpublished>Paperback</swrc:howpublished><swrc:month>May</swrc:month><swrc:publisher><swrc:Organization swrc:name="{W. W. Norton \&amp; Company}"/></swrc:publisher><swrc:title>Nexus: Small Worlds and the Groundbreaking Theory of Networks</swrc:title><swrc:year>2003</swrc:year><swrc:keywords>and groundbreaking networks of small the theory worlds </swrc:keywords><swrc:abstract>{As &lt;I&gt;Chaos&lt;/I&gt; explained the science of disorder, &lt;I&gt;Nexus&lt;/I&gt; reveals the new science of connection and the odd logic of six degrees of separation.  &lt;P&gt; &#034;If you ever wanted to know how many links connect you and the Pope, or why when the U.S. Federal Reserve Bank sneezes the global economy catches cold, read this book,&#034; writes John L. Casti (Santa Fe Institute). This &#034;cogent and engaging&#034; (&lt;I&gt;Nature&lt;/I&gt;) work presents the fundamental principles of the emerging field of &#034;small-worlds&#034; theory\&amp;#151;the idea that a hidden pattern is the key to how networks interact and exchange information, whether that network is the information highway or the firing of neurons in the brain. Mathematicians, physicists, computer scientists, and social scientists are working to decipher this complex organizational system, for it may yield a blueprint of dynamic interactions within our physical as well as social worlds.  &lt;P&gt;Highlighting groundbreaking research behind network theory, &#034;Mark Buchanan&#039;s graceful, lucid, nontechnical and entertaining prose&#034; (Mark Granovetter) documents the mounting support among various disciplines for the small-worlds idea and demonstrates its practical applications to diverse problems\&amp;#151;from the volatile global economy or the Human Genome Project to the spread of infectious disease or ecological damage. &lt;I&gt;Nexus&lt;/I&gt; is an exciting introduction to the hidden geometry that weaves our lives so inextricably together.}</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0393324427" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="405773" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Mark Buchanan"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/28c9a48526caec5e61920bb2664007240/a_olympia"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/28c9a48526caec5e61920bb2664007240/a_olympia"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://arxiv.org/abs/quant-ph/9707033"/><swrc:date>Sat Aug 18 13:22:24 CEST 2007</swrc:date><swrc:month>Jul</swrc:month><swrc:title>Quantum Algorithms and the Fourier Transform</swrc:title><swrc:year>1997</swrc:year><swrc:keywords>algorithm and fourier quantum the transform </swrc:keywords><swrc:abstract>The quantum algorithms of Deutsch, Simon and Shor are described in a way
which highlights their dependence on the Fourier transform. The general
construction of the Fourier transform on an Abelian group is outlined and this
provides a unified way of understanding the efficacy of these algorithms.
Finally we describe an efficient quantum factoring algorithm based on a general
formalism of Kitaev and contrast its structure to the ingredients of Shor&#039;s
algorithm.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="416216" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="quant-ph/9707033" swrc:key="eprint"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Richard Jozsa"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2af79e5516579b52507425809d364cc11/a_olympia"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2af79e5516579b52507425809d364cc11/a_olympia"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://arxiv.org/abs/quant-ph/9607018"/><swrc:date>Sat Aug 18 13:22:24 CEST 2007</swrc:date><swrc:month>Jul</swrc:month><swrc:title>Quantum Copying: Beyond the No-Cloning Theorem</swrc:title><swrc:year>1996</swrc:year><swrc:keywords>beyond copying no-cloning quantum the theorem </swrc:keywords><swrc:abstract>We analyze to what extent it is possible to copy arbitrary states of a
two-level quantum system. We show that there exists a &#034;universal quantum
copying machine&#034;, which approximately copies quantum mechanical states in such
a way that the quality of its output does not depend on the input. We also
examine a machine which combines a unitary transformation with a selective
measurement to produce good copies of states in a neighborhood of a particular
state. We discuss the problem of measurement of the output states.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1296915" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="quant-ph/9607018" swrc:key="eprint"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Vladimir Buzek"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Mark Hillery"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>
