نتایج جستجو برای: snark

تعداد نتایج: 177  

2007
Richard J. Waldinger

Deductive question answering, the extraction of answers to questions from machine-discovered proofs, is the poor cousin of program synthesis. It involves much of the same technology—theorem proving and answer extraction—but the bar is lower. Instead of constructing a general program to meet a given specification for any input—the program synthesis problem—we need only construct answers for spec...

Journal: :IACR Cryptology ePrint Archive 2012
Nir Bitansky Alessandro Chiesa

Succinct arguments of knowledge are computationally-sound proofs of knowledge for NP where the verifier’s running time is independent of the time complexity t of the nondeterministic NP machine M that decides the given language. Existing succinct argument constructions are, typically, based on techniques that combine cryptographic hashing and probabilistically-checkable proofs (PCPs). Yet, even...

2016
Martin R. Albrecht Lorenzo Grassi Christian Rechberger Arnab Roy Tyge Tiessen

We explore cryptographic primitives with low multiplicative complexity. This is motivated by recent progress in practical applications of secure multi-party computation (MPC), fully homomorphic encryption (FHE), and zero-knowledge proofs (ZK) where primitives from symmetric cryptography are needed and where linear computations are, compared to non-linear operations, essentially “free”. Starting...

Journal: :IACR Cryptology ePrint Archive 2014
Huijia Lin Rafael Pass

Assuming the existence of iO for P/poly and one-way functions, we show how to succinctly garble bounded-space computations (BSC) M : the size of the garbled program (as well as the time needed to generate the garbling) only depends on the size and space (including the input and output) complexity of M , but not its running time. The key conceptual insight behind this construction is a method fo...

2009
Richard Hugh Heineman James J. Bull Ian J. Molineux Lauren A. Meyers Andrew D. Ellington Tom Juenger Hugh Heineman

This is for T7 bacteriophage. You may not have evolved to a quantitative optimum, but no matter how many times I kicked you, you kept standing right back up. v 9 3 B Acknowledgements I do not and could not thank my parents, Lucinda and Richard Heineman, enough for all they have done for me. They have always encouraged and supported me in whatever I tried, and put up with an incessant stream of ...

Journal: :Cell 2001
Rob Reenan

definition. The hMre11 function was first detected in by specific nucleotide, on RNA transcription products, should be of interest to many. More so because, while a two-hybrid screen for proteins that interact with the replication factor DNA ligase I, but this putative interac-we can categorize RNA editing events, we cannot yet predict from species to species which genes or sites tion now is be...

1995

of the parser in recognising the prescribed features. At various points, decisions had to be made about what counted as a given feature. We have taken the category of verb to include auxiliary verbs, and also present and past participles where these are constituents of a verb phrase but not otherwise. Thus \the sun is rising" contains two verbs, while \the rising sun" contains none. In the cate...

2013
Randolf Menzel

Memories exist in multiple forms and have multiple functions. They may be categorized according to their cell-physiological substrates along a timescale defined as short-term, mid-term, and long-term memory (STM, MTM, and LTM, respectively). Ongoing neural activity serves as the storage device for STM; intracellular signaling cascades lead to MTM; and gene activation, protein synthesis, and new...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید