Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 1125 for “"Hardness"”.
-
Better Hardness via Algorithms, and New Forms of Hardness versus Randomness
… complexity theory is the rich interplay between hardness (the existence of functions that are hard to compute) and pseudorandomness (the procedure that converts randomized algorithms into equivalent deterministic algorithms). In one direction, from the classic works of Nisan-Widgerson and …
-
Dynamic hardness testing challenges conventional tests
The design and use of a portable dynamic hardness tester is described. The thesis begins with a description of the more common static hardness tests and the usefulness of such tests in industry. It shows a correlation between the different types of hardness and also between hardness and other …
-
Tensors, sparse problems and conditional hardness
In this thesis we study the interplay between theoretical computer science and machine learning in three different directions. First, we make a connection between two ubiquitous sparse problems: Sparse Principal Component Analysis (SPCA) and Sparse Linear Regression (SLR). We show how to …
-
Games meet Concurrency: Algorithms and Hardness
Since the turn of the 21st century, seeing the decline of Moore’s Law on the horizon, the pursuit of continued software performance gains has led to the prominence of computer architectures with high degrees of parallelism and memory cache hierarchies. However, there are still many challenges to …
-
Structure vs. hardness through the obfuscation lens
Cryptography relies on the computational hardness of structured problems. While one-way functions, the most basic cryptographic object, does not seem to require much structure, as we advance up the ranks into public-key cryptography and beyond, we seem to require that certain structured problems …
-
Further Hardness Results for Stephen’s Sausage Roll
… a fascinating set of mechanics for computational hardness problems. The only past results are from a class project in MIT’s 6.5440 class of Fall 2023, which only dealt with two specific subsets of the mechanics restricted to two-dimensional forms of the game [1]. This project presents a more …
-
Hardness in motion : retrieving Johannesburg after Apartheid
This thesis seeks to engage with the city of Johannesburg on terms that break decisively with the linear-historical methods that have been used to both catalogue and decipher the city up to the present. The city is, itself, in its second incarnation - that of the post-apartheid, post-gold mining …
-
Relation between Brinell and Rockwell hardness numbers
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1924.
-
Determination of Hardness in Water by Ion Exchange
… strontium, and zinc. Therefore, the theoretical hardness of a water is defined as the sum of the concentrations of all the metallic cations other than the cations of the alkali metals, expressed as equivalent calcium carbonate concentration. Since calcium and magnesium are usually the only ions …
-
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
… Using this delegation scheme, we show PPAD-hardness (and hence the hardness of computing Nash equilibria) based on the quasi-polynomial hardness of this bilinear group assumption and any hard language that is decidable in quasi-polynomial time and polynomial space. The delegation scheme is …
-
On basing private information retrieval on NP-hardness
… retrieval schemes cannot be based on NP-hardness, unless the polynomial hierarchy collapses. Our main technical contribution is in showing how to break the security of a PIR protocol given an SZK oracle. Our result is tight in terms of both the correctness and the privacy parameter of the …
-
On the hardness of the shortest vector problem
… 1, norm (p >\=1). In particular, we prove the NP-hardness of approximating SVP in the Euclidean norm 12 within any factor less than [square root of]2. The same NP-hardness results hold for deterministic non-uniform reductions. A deterministic uniform reduction is also given under a reasonable …
-
Some hardness escalation results in computational complexity theory
In this thesis, we prove new hardness escalation results in computational complexity theory; a phenomenon where hardness results against seemingly weak models of computation for any problem can be lifted, in a black box manner, to much stronger models of computation by considering a simple gadget …
-
High-dimensional similarity search and sketching : algorithms and hardness
We study two fundamental problems that involve massive high-dimensional datasets: approximate near neighbor search (ANN) and sketching. We obtain a number of new results including: ' An algorithm for the ANN problem over the ℓ₁ and ℓ₂ distances that, for the first time, improves upon the …
-
Improving the polishing process for Rockwell hardness test block
Inefficiencies in a Rockwell hardness test block manufacturing process were analyzed. The polishing stage was identified to be the bottleneck with a high reworking rate. An understanding based on the physics of polishing was the first step. Then a DOE analysis was implemented to find the optimum …
-
Surface hardness classification via unmanned aerial vehicles gripper finger deflection
… (UAV) gripper to determine, upon impact, the hardness of a landing site. We design and fabricate a four finger gripper that uses a rotary component to convert the rotational motion of a servo to the linear motion of the finger assemblies. We functionally test a gripper prototype made from …
-
Comparison Of Vickers Hardness Between Dental Ceramics And Hybrid Materials
The study aims to compare Vickers hardness of five definitive crown materials in a controlled laboratory setting. Materials & Methods: Five specimens (15 x 12 x 1.5 mm) were obtained from each tested material: zirconia (Lava Ultimate), lithium disilicate (IPS e.max CAD), lithium silicate reinforced …
-
Grain hardness and slow dry matter disappearance rate in barley
… this study were to: examine the effect of grain hardness, variety and environment on dry matter disappearance rate (DMDR); identify accurate and efficient hardness selection tools; and study environmental effects, inheritance and heritability of hardness.To study grain hardness and genetic and …
Page 1 of 57