Hardness - PDFSEARCH.IO - Document Search Engine

Hardness
Results: 758

#	Item
71	New Hardness Results for Diophantine Approximation Friedrich Eisenbrand & Thomas Rothvoß Institute of Mathematics EPFL, Lausanne Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Diophantine approximation Approximation algorithm
72	Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger Add to Reading List Source URL: www.cits.rub.de Language: English - Date: 2015-08-28 10:30:32 Cryptography Integer factorization algorithms Computational hardness assumptions E-commerce RSA Quadratic sieve Lattice Integer factorization
73	FACULTY: FIELD OF STUDY: COURSE TITLE: LECTURER’S NAME: E-MAIL ADDRESS OF THE LECTURER: ECTS POINTS FOR THE COURSE: Add to Reading List Source URL: wtie.tu.koszalin.pl Language: English - Date: 2015-03-03 06:21:30 Materials science Hardness tests Fracture mechanics Hardness Matter Charpy impact test Magnet
74	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:20 Computational problems NP-complete problems Optimization problem Synteny Independent set
75	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:55 Complexity classes NP-hardness NP P versus NP problem Computational complexity theory P Reduction
76	QCSP on partially reflexive forests Barnaby Martin Algorithms and Complexity in Durham, Durham University, U.K. CP 2011, Perugia. 14th August 2011. Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-09-13 17:39:08 Complexity classes NP-hardness IP PSPACE-complete NP Reduction PSPACE P FO Circuits over sets of natural numbers True quantified Boolean formula
77	Extending the Hardness of RNA Secondary Structure Comparison Guillaume Blin1 , Guillaume Fertin2 , Irena Rusu2 , and Christine Sinoquet2 1 IGM-LabInfo - UMR CNRSUniversit´e de Marne-la-Vall´ee - France Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:03 Computational phylogenetics Bioinformatics Molecular biology DNA Dynamic programming Equations Complementarity Nucleic acid secondary structure
78	Proudly introduces Nimax Uddeholm Nimax is a low carbon Plastic Mould Steel delivered at a hardness of ~40 HRC Nimax offers the following v v Add to Reading List Source URL: www.buau.com.au Language: English - Date: 2015-11-12 07:16:57 Steels Machinability Machining Metalworking terminology Sandvik Coromant Uddeholms AB Caldie
79	Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-05-08 17:50:59 Complexity classes Computational complexity theory Advice PP P/poly ArthurMerlin protocol Pseudorandom generator Randomized algorithm NP IP Extractor ACC0
80	FORMULATION DEVELOPMENT AND CONTROLS • Solid dosage forms ➡ Powders Add to Reading List Source URL: aptys-pharmaceuticals.com Language: English - Date: 2015-05-30 14:17:43 Materials science Pharmaceutical industry Dosage forms Hardness tests Chemical engineering Tablet Hardness Friability Measuring instrument Viscosity Mixer

UPDATE