Results 71 to 80 of about 460,881 (203)
Limits on Computationally Efficient VCG-Based Mechanisms for Combinatorial Auctions and Public Projects [PDF]
, 2011 A natural goal in designing mechanisms for auctions and public projects is to maximize the social welfare while incentivizing players to bid truthfully.
Buchfuhrer, David Isaac
core +1 more source
Pharmaceutics, 2022 We previously reported that the bioavailability (BA) of irbesartan (IRB), a BSC class II drug, was improved by preparing nanocrystalline suspensions. However, nanocrystalline suspensions have chemical and physical instabilities and must be converted into
Noriaki Nagai +7 more
doaj +1 more source
Scanning Phylogenetic Networks Is NP-hard [PDF]
, 2020 Phylogenetic networks are rooted directed acyclic graphs used to depict the evolution of a set of species in the presence of reticulate events. Reconstructing these networks from molecular data is challenging and current algorithms fail to scale up to genome-wide data.
Berry, Vincent +2 more
openaire +3 more sources
Tile Packing Tomography is NP-hard
Algorithmica, 2009 Discrete tomography deals with reconstructing finite spatial objects from their projections. The objects we study in this paper are called tilings or tile-packings, and they consist of a number of disjoint copies of a fixed tile, where a tile is defined as a connected set of grid points.
Chrobak, Marek +4 more
openaire +7 more sources
Complexity of the Transshipment Problem with a Permutable Transit Vector
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2010 In this paper, we show that the transshipment problem with a permutable transit vector remains NP-hard even when each entry of the given transit vector takes either zero or two. We prove the hardness by a reduction from an NP-complete problem by the name
Yoshiyuki KARUNO +2 more
doaj +1 more source
NP-hardness of circuit minimization for multi-output functions [PDF]
, 2020 Can we design efficient algorithms for finding fast algorithms? This question is captured by various circuit minimization problems, and algorithms for the corresponding tasks have significant practical applications.
Loff, Bruno +3 more
core +1 more source
CoRR, 2014 We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.
openaire +2 more sources
Hardness determination of bio-ceramics using laser-induced breakdown spectroscopy. [PDF]
, 2011 Laser-Induced Breakdown Spectroscopy (LIBS) was applied to the analysis of bioceramic samples. The relationship between sample hardness and LIBS plasma properties was investigated, with comparison to conventional Vickers hardness measurements.
Moser, D. +23 more
core +1 more source
Hardness amplification within NP against deterministic algorithms [PDF]
, 2011 We study the average-case hardness of the class NP against algorithms in P. We prove that there exists some constant μ>0 such that if there is some language in NP for which no deterministic polynomial time algorithm can decide L correctly on a 1−(logn)−μ
Venkatesan Guruswami +3 more
core +1 more source
Hardness Magnification for all Sparse NP Languages
, 2021 © 2019 IEEE. In the Minimum Circuit Size Problem (MCSP[s(m)]), we ask if there is a circuit of size s(m) computing a given truth-Table of length n = 2m.
Williams, R Ryan, Chen, Lijie, Jin, Ce
core +1 more source