Results 261 to 270 of about 369,293 (294)
Some of the next articles are maybe not open access.
On the NP-completeness of cryptarithms
ACM SIGACT News, 1987If we only consider problems with decimal numbers as above there is no possibility of any hardness result, because there are only 10! different assignments of digits and letters to try. Therefore we will generalize the problem slightly: the base of representation for our numbers will be given as part of the problem (expressed in unary or binary) rather
openaire +2 more sources
Properties of NP-complete sets
Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., 2004We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S \not\supseteq L is a p-selective sparse set, then L - S is \leq pm-hard for NP. We demonstrate the existence of a sparse set S \in DTIME(22n) such that for every L \in NP - P, L - S is not \leq pm-hard for NP.
Christian Glaßer +3 more
openaire +3 more sources
The NP-Completeness of Edge-Coloring
SIAM Journal on Computing, 1981We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for cubic graphs.
openaire +3 more sources
Theory-Contraction is NP-Complete
Logic Journal of IGPL, 2003Summary: The author investigates the problem of contracting a dependency-network with respect to any of its nodes. The resulting contraction must not contain the node in question, but must also be a minimal mutilation of the original network. Identifying successful and minimally mutilating contractions of dependency-networks is non-trivial, especially ...
openaire +1 more source
Knowledge Graph Completeness: A Systematic Literature Review
IEEE Access, 2021Faycal Hamdi +2 more
exaly
Quantifying sample completeness and comparing diversities among assemblages
Ecological Research, 2020David Zelený +2 more
exaly
Defining and measuring completeness of electronic health records for secondary use
Journal of Biomedical Informatics, 2013Chunhua Weng +2 more
exaly
Evaluation of data quality in the cancer registry: Principles and methods Part II. Completeness
European Journal of Cancer, 2009Freddie Bray, D Max Parkin
exaly
On the completeness of meshfree particle methods
International Journal for Numerical Methods in Engineering, 1998John Dolbow
exaly