Results 161 to 170 of about 6,830,035 (189)
Some of the next articles are maybe not open access.
2012
A cynical view of graph algorithms is that “everything we want to do is hard.”Indeed, no polynomial-time algorithms are known for any of the problems in this section.All of them are provably NP-complete with the exception of graph isomorphism—whose complexity status remains an open question.
openaire +1 more source
A cynical view of graph algorithms is that “everything we want to do is hard.”Indeed, no polynomial-time algorithms are known for any of the problems in this section.All of them are provably NP-complete with the exception of graph isomorphism—whose complexity status remains an open question.
openaire +1 more source
The Hard Problem Isn’t Getting any Easier: Thoughts on Chalmers’ “Meta-Problem”
Philosophia (United States), 2021Ben White
exaly
The hard problem makes the easy problems hard - a reply to Doerig et al.
Cognitive Neuroscience, 2021Yair Pinto, Timo Stein
exaly
Some Conditionally Hard Problems on Links and 3-Manifolds
Discrete and Computational Geometry, 2017Marc Lackenby
exaly
Spacetime emergence in quantum gravity: functionalism and the hard problem
SynthÈse, 2019Baptiste Le Bihan
exaly
A multi-parameter analysis of hard problems on deterministic finite automata
Journal of Computer and System Sciences, 2015Pinar Heggernes +2 more
exaly