3 papers
cs.CC2023
A new approach for a proof that P is NP
Malay Dutta, Anjana K. Mahanta
In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such…
cs.CC2022
Basis for a vector space generated by Hamiltonian time paths in a complete time graph
Malay Dutta, Anjana K. Mahanta
In this paper we introduce the notion of a complete time graph of order n. We define time paths and Hamiltonian time paths in a complete time graph. Each Hamiltonian time path (htp…
cs.DB2012
Detection of Calendar-Based Periodicities of Interval-Based Temporal Patterns
Anjana K. Mahanta, Mala Dutta
We present a novel technique to identify calendar-based (annual, monthly and daily) periodicities of an interval-based temporal pattern. An interval-based temporal pattern is a pat…