Results 51 to 60 of about 872,020 (326)

Improved Generic Algorithms for Hard Knapsacks [PDF]

open access: yes, 2011
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time O(20.337n) and memory O(20.256n), thereby improving a 30-year old algorithm by Shamir and Schroeppel. In this paper we extend the Howgrave-Graham-Joux technique to get an algorithm with running time down to O(20.291n).
Anja Becker 0001   +2 more
openaire   +3 more sources

A Simple Model to Generate Hard Satisfiable Instances [PDF]

open access: yesCoRR, 2005
Proc. of 19th IJCAI, pp.337-342, Edinburgh, Scotland, 2005.
Xu, K.   +3 more
openaire   +3 more sources

The influence of welding condition on the microstructure of WC hardfacing coating on carbon steel substrate [PDF]

open access: yes, 2019
Tungsten carbide (WC) hardfacing coating technique is widely used to improve the performance of carbon steel blade exposed to acidic and abrasive conditions during production.
Jamian, S.   +8 more
core   +1 more source

PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science

open access: yesAdvanced Engineering Materials, EarlyView.
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley   +1 more source

How hard is compiler code generation? [PDF]

open access: yes, 1977
Over the past two decades great strides have been made in understanding how to design lexical and syntactic analyzers for programming-language compilers. Theory and practice have proceeded to the point where usable lexical and syntactic analyzers can be generated automatically from notations based on regular expressions and context-free grammars [Aho ...
Alfred V. Aho, Ravi Sethi
openaire   +1 more source

Molecular Dynamics Studies of Shape Memory Polymers: From Bead–Spring Models to Atomistic Simulations

open access: yesAdvanced Engineering Materials, EarlyView.
Coarse‐grained (left) and atomistic (right) models of the shape memory polymer ESTANE ETE 75DT3 are shown schematically. The two representations bridge molecular detail and mesoscopic description. Both models capture shape memory behavior, linking segmental mobility and conformational relaxation of anisotropic chains to macroscopic recovery, and ...
Fathollah Varnik
wiley   +1 more source

Generic Construction of Forward-Secure Revocable Identity-Based Signature and Lattice-Based Instantiations

open access: yesSecurity and Communication Networks, 2022
Forward-secure revocation is a powerful cryptographic technique to alleviate key exposure attacks on identity-based cryptosystems. In recent years, quantum computers have made some breakthroughs, so in the foreseeable future, existing cryptographic ...
Yan He   +4 more
semanticscholar   +1 more source

Generalized juntas and NP-hard sets

open access: yesTheoretical Computer Science, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gábor Erdélyi   +3 more
openaire   +1 more source

Water Permeates and Plasticizes Amorphous Carbon Dots: Unraveling the Inner Accessibility of the Nanoparticles by Glass Transition Studies

open access: yesAdvanced Materials, EarlyView.
The water permeability of amorphous carbon dots (CDs) is demonstrated by investigating their plasticization. Novel polyamide‐based and amorphous nanoparticles are synthesized by controlling their inner packing density. Water plasticization is evidenced by the decrease of the CDs glass transition temperature with increasing the hydration degree.
Elisa Sturabotti   +8 more
wiley   +1 more source

Hard instance generation for SAT

open access: yesCoRR, 1997
We consider the problem of generating hard instances for the Satisfying Assignment 'TechSearch Problem (in short, SAT). It is not known whether SAT is difficult on average, while it has been believed that the Factorization Problem (in short, FACT) is hard on average.
Satoshi Horie, Osamu Watanabe 0001
openaire   +3 more sources

Home - About - Disclaimer - Privacy