Browse research papers in Computational Theory and Mathematics - Computer Science Discover 6 academic papers with AI-powered analysis

PAPERZILLA

Crunching Academic Papers into Bite-sized Insights.

About

Sign Out

← Back

Fields

Computer Science

Computational Theory and Mathematics

The mathematical foundations of computing, including algorithms, complexity theory, automata theory, formal languages, cryptography, and the theoretical limits of computation

6 papers in this specialization

Papers

Scientific Machine Learning Through Physics-Informed Neural Networks: Where we are and What's Next

Physics-Informed Neural Networks (PINNs) offer a novel approach to solving partial differential equations by incorporating physical laws into the learning process. While promising for various applications, including fluid dynamics, optics, and material science, PINNs face challenges related to theoretical understanding, computational cost, and accuracy in complex physical phenomena.

★

☆

s10915-022-01939-z.pdf

Jul 14, 05:25 PM

DOUBLE PHASE IMPLICIT OBSTACLE PROBLEMS WITH CONVECTION AND MULTIVALUED MIXED BOUNDARY VALUE CONDITIONS

This paper proves the existence and weak compactness of solutions for a double-phase implicit obstacle problem with convection and multivalued mixed boundary conditions. The results are established under general assumptions using fixed-point theory, nonsmooth analysis, and variational methods.

A SARS-CoV-2 protein interaction map reveals targets for drug repurposing

This study mapped 332 SARS-CoV-2-human protein interactions, revealing key pathways hijacked by the virus, including translation, vesicle trafficking, and innate immunity. This led to the identification of 69 existing compounds targeting these interactions, with some showing promising antiviral activity in vitro, particularly translation inhibitors and sigma receptor ligands.

★

☆

s41586-020-2286-9.pdf

Jul 14, 10:36 AM

Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem

The paper describes a new heuristic algorithm for the Traveling Salesman Problem (TSP) with a time complexity of O(n³) that guarantees a solution no worse than 3/2 times the optimal solution when the triangle inequality holds. This represents a 50% improvement over the previous best-known worst-case ratio of 2 for polynomial-time TSP heuristics.

★

☆

s43069-021-00101-z.pdf

Jul 14, 10:36 AM

Why general artificial intelligence will not be realized

The author argues against the possibility of achieving Artificial General Intelligence (AGI) because computers lack embodiment, lived experience, and the ability to interact with the world like humans. The paper claims that recent advancements in AI, while impressive, are limited to narrow applications (ANI) and do not represent progress towards true general intelligence.

★

☆

s41599-020-0494-4.pdf

Jul 14, 10:36 AM

GL-LowPopArt: A Nearly Instance-Wise Minimax-Optimal Estimator for Generalized Low-Rank Trace Regression

The paper introduces GL-LowPopArt, a two-stage estimator for generalized low-rank trace regression that achieves near instance-wise optimality. It outperforms existing methods by adapting to instance-specific curvature, and a corresponding minimax lower bound confirms its near-optimality.

★

☆

2506.03074v1-embedded-msg.pdf

Jul 08, 11:34 AM