DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Mark Jerrum
Mark Jerrum
Resource-Competitive Algorithms1 1 Introduction
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
Arxiv:1611.01647V4 [Cs.DS] 15 Jan 2019 Resample to Able of Are Class We Special Techniques, Our a with for Inst Extremal Solutions Answer
On the Complexity of Partial Derivatives Ignacio Garcia-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé
Interactions of Computational Complexity Theory and Mathematics
Statistical Queries and Statistical Algorithms: Foundations and Applications∗
The Trichotomy of HAVING Queries on a Probabilistic Database
Contents - Part II
Download This PDF File
Edinburgh Research Explorer
Is the Space Complexity of Planted Clique Recovery the Same As That of Detection?
From the AMS Secretary
On the Nature of the Theory of Computation (Toc)∗
Interactions of Computational Complexity Theory and Mathematics
[ 9] Is a Classical Gem in Combinatoric
A Polynomial-Time Approximation Algorithm for the Permanent of A
Testing Closeness of Discrete Distributions
Sponsored by IEEE Computer Society Technical Committee On
Top View
Association Schemes, Non-Commutative Polynomial Concentration, and Sum-Of-Squares Lower Bounds for Planted Clique
Novel Frameworks for Mining Heterogeneous and Dynamic
The Average-Case Complexity of Counting Cliques in Erdős-Rényi
A Matrix Chernoff Bound for Markov Chains and Its Application to Co-Occurrence Matrices
Lecture Notes in Computer Science 1853 Edited by G
Lovász-Schrijver Reformulation
Almost-Polynomial Ratio ETH-Hardness of Approximating
The Complexity of Public-Key Cryptography
Lipics-CCC-2021-0.Pdf (0.5
Reconfiguration and Combinatorial Games
Accepted Papers Paper Titles and Author Information Appears As Submitted to Easy Chair
Grenzen Op De Mengtijd En Versnelling Van Klassieke Walks Quantum Walks
The Complexity of Public-Key Cryptography
Edinburgh Research Explorer
Counting and Markov Chains by Mark Jerrum