Results 21 to 30 of about 346,551 (253)
Hardness of Approximation for Knapsack Problems [PDF]
Theory of Computing Systems, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H.M. Buhrman (Harry) +2 more
openaire +4 more sources
Ten Testable Properties of Consciousness
Frontiers in Psychology, 2020 This article develops a view of consciousness in the context of a new philosophical approach that invokes the concept of emergence, through which the operative principles of each level of organization of physical energy flow are functionally dissociated ...
Christopher W. Tyler
doaj +1 more source
Process Metaphysics of Consciousness
Open Philosophy, 2018 In this article, we look at the hard problem of consciousness from the perspective of process metaphysics. We thereby identify three problematic premises of the problem that pertain to the constitution of consciousness and its causal relation to the ...
Prentner Robert
doaj +1 more source
Hardness of Approximation for Quantum Problems [PDF]
Quantum Information and Computation, 2012 The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate.
Sevag Gharibian, Julia Kempe
openaire +2 more sources
The Problem of Morality in Soft and Hard Legal Positivism [PDF]
Journal of Philosophical Investigations, 2023 The law is the reason and guide for human behavior; therefore, it is a normative social practice. But what conditions should a norm have to be called a law and what is its relationship with morality?
Ataollah Salehi, Mahdi Balavi
doaj +1 more source
Explanation and the Hard Problem [PDF]
Philosophical Studies, 2006 This paper argues that the form of explanation at issue in the hard problem of consciousness is scientifically irrelevant, despite appearances to the contrary. In particular, it is argued that the ‘sense of understanding’ that plays a critical role in the form of explanation implicated in the hard problem provides neither a necessary nor a sufficient ...
openaire +1 more source
SETH-Hardness of Coding Problems [PDF]
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019 We show that assuming the strong exponential-time hypothesis (SETH), there are no non-trivial algorithms for the nearest codeword problem (NCP), the minimum distance problem (MDP), or the nearest codeword problem with preprocessing (NCPP) on linear codes over any finite field.
Stephens-Davidowitz, Noah +1 more
openaire +4 more sources
Hardness Magnification for Natural Problems [PDF]
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018 We show that for several natural problems of interest, complexity lower bounds that are barely non-trivial imply super-polynomial or even exponential lower bounds in strong computational models. We term this phenomenon "hardness magnification". Our examples of hardness magnification include: 1.
Santhanam, R, Oliveira, IC
openaire +2 more sources
The k-Anonymity Problem Is Hard [PDF]
, 2009 21 pages, A short version of this paper has been accepted in FCT 2009 - 17th International Symposium on Fundamentals of Computation ...
Bonizzoni, P, Della Vedova, G, Dondi, R
openaire +3 more sources
On the Hardness of Range Assignment Problems [PDF]
Networks, 2006 AbstractWe investigate the computational hardness of the connectivity, the strong connectivity, and the broadcast type of range assignment problems in ℝ2 and ℝ3. We present new reductions for the connectivity problem, which are easily adapted to suit the other two problems.
openaire +2 more sources