136,256 research outputs found
Portrait of Eric Bogle, singer and songwriter, Canberra, A.C.T., 27 June 1999 [picture] /
No full textCondition: Good.; Part of collection: Collection of portraits of Eric Bogle, singer and songwriter, Canberra, A.C.T., 27 June 1999.; Title supplied by photographer.; Also available in an electronic version via the Internet at: http://nla.gov.au/nla.pic-an24430019
EMSO ERIC Data Management Plan
No full text<p>The purpose of the EMSO ERIC Data Management Plan is to serve as a comprehensive guide to how the EMSO ERIC data are and will be managed within the EMSO ERIC consortium, from collection to long-term preservation and accessibility to the broader scientific community and stakeholders at large.</p>
EMSO ERIC Long-term vision and strategic plan 2021-2023
No full textHigh-quality and timely marine environmental information will nourish mitigation and protection strategies in the face of significant challenges and threats, such as natural disasters, habitat loss, human and species migration, and food security, together with the deprivation due to marine-related industry activities, tourism, and recreation.
EMSO ERIC will provide bio-geophysical, and chemical information needed to monitor the impact of climate change on the ocean system, mitigation of geo-hazards risk, and progress in deep-sea habitat mapping.
EMSO ERIC will promote the creation of new hi-tech jobs, and spur the development of innovative applications and services in strategic industrial sectors such as marine robotics, blue biotech, offshore aquaculture, seabed resources, smart submarine cables, marine renewable energy, pharmaceutical, fishing and tourism
Eric Karl Spangenberg
No full textA long-time resident of Portola Valley and Palo Alto, Eric Karl Spangenberg passed away at his home on November 28, 2021. He worked with the injection group at Stanford Linear Accelerator and completed a Master of Science from Stanford University in 1979
Zero Knowledge and Circuit Minimization
No full textWe show that every problem in the complexity class SZK (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (MCSP). In particular Graph Isomorphism lies in RP MCSP.
This is the first theorem relating the computational power of Graph Isomorphism and MCSP, despite the long history these problems share, as candidate NP-intermediate problems.Peer reviewe
Zero Knowledge and Circuit Minimization
No full textWe show that every problem in the complexity class SZK (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (MCSP). In particular Graph Isomorphism lies in RPMCSP.
This is the first theorem relating the computational power of Graph Isomorphism and MCSP, despite the
long history these problems share, as candidate NP-intermediate problemsPeer reviewe
Syntactic separation of subset satisfiability problems
No full textVariants of the Exponential Time Hypothesis (ETH) have been used to derive lower bounds on the time complexity for certain problems, so that the hardness results match long-standing algorithmic results. In this paper, we consider a syntactically defined class of problems, and give conditions for when problems in this class require strongly exponential time to approximate to within a factor of (1 − ε) for some constant ε > 0, assuming the Gap Exponential Time Hypothesis (Gap-ETH), versus when they admit a PTAS. Our class includes a rich set of problems from additive combinatorics, computational geometry, and graph theory. Our hardness results also match the best known algorithmic results for these problems.Peer reviewe
Better Complexity Bounds for Cost Register Automata
No full textCost register automata (CRAs) are one-way finite automata whose transitions have the side-effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring can simulate polynomial time computation, proving along the way that a naturally dened width-k circuit value problem over the tropical semiring is P-complete. Then the copyless variant of the CRA, requiring that semiring operations be applied to distinct registers, is shown no more powerful than NC^1 when the semiring is the integers, or strings with operations max and concat. This relates questions left open in recent work on the complexity of CRA-computable functions to long-standing class separation conjectures in complexity theory, such as NC versus P and NC^1 versus GapNC^1.Peer reviewe
Better Complexity Bounds for Cost Register Automata
No full textCost register automata (CRAs) are one-way finite automata whose transitions have the side-effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring can simulate polynomial time computation, proving along the way that a naturally dened width-k circuit value problem over the tropical semiring is P-complete. Then the copyless variant of the CRA, requiring that semiring operations be applied to distinct registers, is shown no more powerful than NC1 when the semiring is the integers, or strings with operations max and concat. This relates questions left open in recent work on the complexity of CRA-computable functions to long-standing class separation conjectures in complexity theory, such as NC versus P and NC1 versus GapNC1.Paper presented at the 42nd International Symposium on Mathematical Foundations of Computer Science, August 21-25, 2017, Aalborg, Denmark. This is the Author’s Original, a longer and more complete version of the paper published in: Larsen, K.G., Bodlaender, H.L., & Raskin, J.-F. (Eds.). (2017). Proceedings from 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. (Leibniz International Proceedings in Informatics (LIPIcs)). DOI: 10.4230/LIPIcs.MFCS.2017.24.Peer reviewed
Glen Farris, Warden Wendall Long and Eric Z.
No full textGlen Farris, Warden Wendall Long and Eric Z.https://digitalmaine.com/dmr_images/4839/thumbnail.jp
- …
