9 search results - page 1 / 2 » fct 1999 |
FCT
1999
Springer
13 years 9 months ago
1999
Springer
FCT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
FCT
1999
Springer
13 years 9 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
FCT
1999
Springer
13 years 9 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
FCT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...