RPR. Pallavi

R. Pallavi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


R. Pallavi has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Tri-Paradigm analysis of computational complexity in NP-Hard Sudoku solvers using explainable AI

    by Rajan Thangamani, Pallavi R

    Sudoku is a demanding test of computational complexity and constraint satisfaction problems. This work develops a comprehensive and replicable benchmark that reformulates 9×9 Sudoku puzzles under three solver paradigms of constraint programming (CP), Boolean satisfiability (SAT), and integer programming (IP) in order to assess efficacy and explainability. For each paradigm, a parametrically equivalent model is implemented and solved with common datasets and experiment control conditions. We measure wall-clock running time, peak memory usage, and paradigm-data related measures of effort in backtracks or fails in CP, decisions or conflicts with conflict-driven clause learning(CDCL) in SAT, and branch & bound nodes or linear program relaxations in IP. Aggregate trends provide empirical evidence consistent with NP-hard/NP-complete behavior: runtime grows approximately exponentially with constraint tightness, while memory remains nearly flat for standard grids. An explicit Explainable Artificial Intelligence (XAI) trade-off emerges. SAT delivers the lowest runtime via clause learning and pruning; CP yields the most interpretable reasoning through transparent propagation and traceable search; IP offers algebraic auditability and flexibility for optimization variants but incurs higher search effort on pure feasibility. The benchmark, figures, and tables establish a verifiable claim–evidence link and supply a practical baseline for integrating explainability metrics into analytic decision pipelines. The results inform the design of intelligent and explainable solver architectures, aligning with the aim of Intelligent systems with applications. We conclude with a roadmap toward hybrid CP–SAT approaches that retain CP-level interpretability while leveraging SAT-level efficiency.

  • Open Access

    Complexity-Aware Symbolic Solvers for Sudoku: Towards Interpretability and Cognitive Alignment in Constraint Problem Solving

    by Rajan Thangamani, R Pallavi

    SAT and Constraint Programming (CP) remain the fastest exact Sudoku solvers, on average taking milliseconds to solve even hard puzzles. They are, however, black-box optimizers and hence lack symbolic interpretability. The present article describes a complementary deterministic approach that explains reasoning with four symbolic solvers: Dynamic Constraint Propagation Backtracking (DCPB), Constraint Density–Guided Search (CDGS), Logical Inference Depth (LID) Solver, and Guessing-Complexity-Optimized Solver (GCOS). Each solver is governed by formally stated complexity indicators Constraint Density Metric (CDM), Logical Inference Depth (LID), Constraint-Graph Tightness (CGT), and Guess Entropy (local/global) such that inference effort is transparently computed. Our contributions are threefold. First, we formalize reproducible symbolic complexity measures that capture inference effort and search ambiguity. Second, we implement four deterministic solvers each balancing runtime against interpretability while producing traceable reasoning traces. Third, we introduce the Solver–Complexity Alignment Index (SCAI), a new measure for the extent to which solver effort aligns with intrinsic puzzle hardness. On the Kaggle Sudoku dataset (1M puzzle–solution pairs), we find that while the CP and SAT baselines are unparalleled for runtime efficiency, symbolic solvers dominate in interpretability, reproducibility, and solver–complexity alignment. Most balanced in terms of runtime and SCAI alignment is the LID solver, while best at compressing entropy is GCOS. The work constitutes a contribution to explainable constraint solving and advances the alignment between solver effort and human intuitions on puzzle hardness. The concepts are generalizable to the broader constraint satisfaction, planning, and scheduling applications where interpretability must be as valuable as speed. Our solvers are tested on the 1 million–puzzle Kaggle Sudoku dataset (1,000,000 puzzle–solution pairs; Bryan Park), with detailed experimentation on a stratified subset (10 Easy, 10 Medium, 10 Hard).

  • A novel ontological-based trust aware hybrid key management scheme (OTAHKMS) to enhance network lifetime and energy usage in wireless sensor networks (WSNs)

    by Amit Barve, R. Pallavi, Shashikant Deepak, R. Murugan, Dhananjay Yadav, Ashutosh Kr. Singh, Meenakshi Sharma, S. Shalini


  • Object Localization in Emoji-Based Social Networks Using Deep Learning Techniques

    by Galiveeti Poornima, Y. Sudha, B. C. Manujakshi, R. Pallavi, Deepak S. Sakkari, P. Karthikeyan

  • Analysis of Geospatial Data Collected by Drones as Part of Aerial Computing

    by Galiveeti Poornima, Deepak S. Sakkari, T. N. Manjunath, M. A. Sukruth Gowda, R. Pallavi