A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length.

Yaroslav Shitov

Published in: Theor. Comput. Sci. (2017)

Keyphrases

fixed length
variable length
feature vectors
sequential data
np complete
vector representation
bitstream
theorem proving
image processing
computer vision
image sequences
computational complexity
np hard
theorem prover
computational problems