Results 151 to 160 of about 6,830,035 (189)

Minimal NFA problems are hard

SIAM Journal on Computing, 1991
Summary: Finite automata (FA's) are of fundamental importance in theory and in applications. The following basic minimization problem is studied: Given a DFA (deterministic FA), find a minimum equivalent nondeterministic FA (NFA). This paper shows that the natural decision problem associated with it is PSPACE-complete.
Tao Jiang 0001, Bala Ravikumar
openaire   +3 more sources

On the hardness of the Consensus String problem

Information Processing Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir, Haim Paryenty, Liam Roditty   +2 more
openaire   +1 more source

On the hardness of approximating minimization problems

Journal of the ACM, 1993
Summary: We prove results indicating that it is hard to compute efficiently good approximate solutions to the Graph Coloring, Set Covering and other related minimization problems. Specifically, there is an \(\varepsilon > 0\) such that Graph Coloring cannot be approximated with ratio \(n^ \varepsilon\) unless \(P = NP\).
Carsten Lund, Mihalis Yannakakis
openaire   +3 more sources

Covering problems with hard capacities

The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
We consider the classical vertex cover and set cover problems with hard capacity constraints. This means that a set (vertex) can cover only a limited number of its elements (adjacent edges), and the number of available copies of each set (vertex) is bounded.
Julia Chuzhoy, Joseph Naor
openaire   +1 more source

On the hardness of NTRU problems

Frontiers of Computer Science, 2022
Yang Wang 0050, Mingqiang Wang
openaire   +2 more sources

The Hard Problem

Science, 2009
In the letter “Neuroscience and the soul” (27 February, p. [1168][1]), M. J. Farah and N. Murphy state that eventually neuroscience and the material system it describes may be able to explain all facets of being human. This idea strikes me as a somewhat naive and simple faith in scientific progress rather than an accurate assessment of current thinking
openaire   +1 more source

Hard-core distributions for somewhat hard problems

Proceedings of IEEE 36th Annual Foundations of Computer Science, 2002
Consider a decision problem that cannot be 1-/spl delta/ approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a /spl delta/ fraction of instances. We show that for any such problem there is a specific "hard core" set of inputs which is at least a /spl delta/ fraction of all inputs and ...
openaire   +1 more source

The Hard Problem

2015
Probability theory and the name of the market have been improperly mixed at the beginning. We relied only on our familiarity with their terms. The market is not just the market; it is essential for thought. You may think it is not as fundamental as a physical theory; in fact, it is as fundamental as a metaphysical theory.
openaire   +2 more sources

A statistical perspective on non-deterministic polynomial-time hard ordering problems: Making use of design for order-of-addition experiments

Computers and Industrial Engineering, 2021
Jianbin Chen, Jiayu Peng
exaly  

Facing up to the Hard Problem of Consciousness as an Integrated Information Theorist

Foundations of Science, 2021
Francesco Ellia, Robert Chis-Ciure
exaly