Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra

Source URL: www.cims.nyu.edu

• Computational geometry
• Ε-net
• Connectivity
• NP
• Erasure code
• Planar graph
• NP-complete problems
• Dominating set
• Tutte polynomial
• Graph theory
• Theoretical computer science
• Mathematics

Normality in non-integer bases and polynomial time randomness Javier Almarza Santiago Figueira

Source URL: www.glyc.dc.uba.ar

. . Harvey’s Average Polynomial Time Algorithms Joshua E. Hill Department of Mathematics, University of California, Irvine

Source URL: www.untruth.org

BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Source URL: www.brics.dk

• Graph
• Matching
• Bipartite graph
• Independent set
• Matroid theory
• Tutte polynomial
• Path decomposition
• Graph theory
• Mathematics
• NP-complete problems

R/I SOLVE: Rational/Integer Polynomial Solvers Francis J. Wright School of Mathematical Sciences Queen Mary and Westfield College University of London Mile End Road, London E1 4NS, UK.

Source URL: reduce-algebra.com

FINITE TYPE INVARIANTS OF W-KNOTTED OBJECTS I: W-KNOTS AND THE ALEXANDER POLYNOMIAL DROR BAR-NATAN AND ZSUZSANNA DANCSO Abstract. This is the first in a series of papers studying w-knots, and more generally, w-knotted ob

Source URL: www.math.toronto.edu

22 IP1 Structural and Logical Approaches to the Graph Isomorphism Problem The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has

Source URL: www.siam.org

Fast Probabilistic Algorithms for Verification of Polynomial Identities J. T. SCHWARTZ New York Umverszty, New York, New York ABSTRACT T h e starthng success o f the R a b m - S t r a s s e n - S o l o v a y p n m a h t

Source URL: www.cs.duke.edu

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Incredible ELK From Polynomial Procedures to Efficient Reasoning with EL Ontologies Yevgeny Kazakov · Markus Krötzsch · František Sim

Source URL: elk.semanticweb.org

A Higher Order Characterization of Probabilistic Polynomial Time Ugo Dal Lago Paolo Parisen Toldin Abstract

Source URL: www.cs.swan.ac.uk