Results 41 to 50 of about 6,830,035 (189)
A constraint programming approach to the stable marriage problem [PDF]
, 2001 The Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a Constraint Satisfaction Problem.
Irving, R.W. +4 more
core +4 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
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
The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize? [PDF]
, 2018 The role that the mental, or internal, representation plays when people are solving hard computational problems has largely been overlooked to date, despite the reality that this internal representation drives problem solving.
Stege, Ulrike +2 more
core +1 more source
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
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 +3 more sources
Life and experience as irreducible dimensions of nature
Frontiers in PsychologySpace and time are irreducible dimensions of nature—measurable but not derivable from anything more fundamental. Life and experience are here proposed as similarly irreducible dimensions.
Fredric Schiffer +3 more
doaj +1 more source
The causal efficacy of consciousness: a neuroscientific analysis and explanation
Frontiers in Human NeuroscienceThis study analyzes neural and behavioral events occurring before, during, and after the emergence of a pain quale and the consciousness of that pain to examine the causal efficacy of the quale and consciousness.
Chirapat Ukachoke
doaj +1 more source