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 1143 for “"NP"”.
-
NP-completeness notions under strong hypotheses
… of completeness notions for the complexity class NP are studied under strong hypotheses about the size of this class. These hypotheses are based on the concept of resource-bounded genericity developed by Ambos-Spies, Fleischhack and Huwig. It is shown that many natural completeness notions for NP …
-
An Interactive Tutorial for NP-Completeness
… Complexity Theory, reductions, and the NP-Complete class of problems are considered difficult by students. Numerous algorithm visualizations (AVs) have been developed over the years to portray the dynamic nature of known algorithms commonly taught in undergraduate classes. However, to …
-
Rate-1 non-interactive arguments for batch-NP
Succinct non-interactive arguments for batch-NP computations, called BARGs (Choudhuri, Jain and Jin, STOC 2021), have emerged as a powerful tool to construct succinct non-interactive arguments (SNARGs) for expressive classes of computations such as all deterministic computations (P), time-space …
-
On basing private information retrieval on NP-hardness
… objects on the (minimal) assumption that NP ... BPP is at the very heart of complexity-theoretic cryptography. Most known results along these lines are negative, showing that assuming widely believed complexity-theoretic conjectures, there are no reductions from an NP-hard problem to the …
-
Programación celular resolución eficiente de problemas numéricos NP-completos
… electrónico ni bioquímico. A menos que P = NP, para atacar de manera eficiente la resolubilidad de problemas NP-completos es necesario disponer de mecanismos que permitan fabricar una cantidad de espacio de tamaño exponencial en tiempo polinomial. Los sistemas celulares con membranas activas …
-
Word order, NP movements, and opacity conditions in Persian
This study investigates word order and NP-movement phenomena in Persian within the framework of Government and Binding as developed in Chomsky (1981, 1986b) and subsequent work.
-
Physical manifestation of NP-completeness in analog computer devices
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Zum Komplexbildungsverhalten ausgewählter Actiniden (U, Np, Cm) mit mikrobiellen Bioliganden
… sich mit der Wechselwirkung der Actiniden U(VI), Np(V) und Cm(III) mit Modellliganden, die die Funktionalitäten der Pyoverdine simulieren. Für die Metallbindung der Pyoverdine sind die Katecholgruppe des Chromophors und die funktionellen Gruppen der Peptidkette (Hydroxamsäuregruppen und …
-
Learning NP-hard problems on networks using Geometric Deep Learning
… domains like graphs, can aid the computation of NP-hard problems and learn heuristics from the data. Specifically, we define a framework, namely GDM, to learn how to solve the Network Dismantling and Link Building problems on the optimal solutions computed on small synthetic graphs, and then …
-
Linear and nonlinear semidefinite relaxations of some NP-hard problems
… bounds and obtain approximate solutions for NP-hard problems. This thesis introduces and studies several novel linear and nonlinear semidefinite relaxation models for some NP-hard problems. We first study the semidefinite relaxation of Quadratic Assignment Problem (QAP) based on matrix …
-
The learning of coreferential NP reductions by adult Persian speakers
… Persian speakers learning certain coreferential NP reductions in English was planned and executed. The main purpose of the study was to validate empirically several key hypotheses in second learning theory, with a secondary purpose being to obtain a description of what is difficult and what is …
-
Modeling tritium release from TRISO-coated NP-MHTGR target particles
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Nuclear Engineering, 1992.
-
Differential cross section measurement for the d(n,np) reaction
… cross section for the quasielastic d(n,np) neutron-induced deuteron breakup reaction was measured as a function of incident and scattered particle energies and angles, using a liquid deuterium target at the Weapons Neutron Research (WNR) spallation neutron beam at the Los Alamos Neutron …
-
Query-efficient checking of proofs and improved PCP characterizations of NP
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Crossing and nested paths--NP movement in accusative and ergative languages
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1992.
-
Below P vs NP : fine-grained hardness for big data problems
The theory of NP-hardness has been remarkably successful in identifying problems that are unlikely to be solvable in polynomial time. However, many other important problems do have polynomial-time algorithms, but large exponents in their runtime bounds can make them inefficient in practice. For …
-
Observations and comments on the rule of Equi-NP deletion in English syntax
Photocopy of typescript.
-
Observations and comments on the rule of Equi-NP deletion in English syntax
Photocopy of typescript.
Page 1 of 58