Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Approximating the permanent is in RNC
Josep Dı́az
,
María Serna
,
Paul G. Spirakis
Type:
Article
Publication Date:
1995-04-01
Citations:
0
Share
Similar Works
Action
Title
Year
Authors
+
On RNC approximate counting
1994
Josep Dı́az
María Serna
Paul G. Spirakis
+
Approximate Counting
1995
Rajeev Motwani
Prabhakar Raghavan
+
Exact Sampling from Perfect Matchings of Dense Nearly Regular Bipartite Graphs
2003
Mark Huber
+
On approximating the permanent and other #p-complete problems
1998
Lars Eilstrup Rasmussen
Alistair Sinclair
+
Probabilistic and Deterministic Approximations of the Permanent
1999
Avi Wigderson
+
Approximating the permanent: A simple approach
1994
Lars Eilstrup Rasmussen
+
PDF
Chat
Approximate counting, uniform generation and rapidly mixing Markov chains
1989
Alistair Sinclair
Mark Jerrum
+
Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
2019
Andreas Björklund
Ryan Williams
+
An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix
2004
Martin Fürer
Shiva Prasad Kasiviswanathan
+
PDF
Chat
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler
2021
Zhengfeng Ji
Zhihan Jin
Pinyan Lu
+
A scaling limit for the length of the longest cycle in a sparse random digraph
2020
Michael Anastos
Alan Frieze
+
Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs
2021
Farzam Ebrahimnejad
Ansh Nagda
Shayan Oveis Gharan
+
An algorithmic proof of Brégman–Minc theorem
2009
Li Xu
Heng Liang
Fengshan Bai
+
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler
2019
Zhengfeng Ji
Zhihan Jin
Pinyan Lu
+
PDF
Chat
A deterministic approximation algorithm for computing the permanent of a <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:math> matrix
2010
David Gamarnik
Dmitriy Katz
+
Random dense matrices
2020
+
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
1998
Josep Dı́az
Jordi Petit
Panagiotis Psycharis
Marı́a Serna
+
Fast approximation of the permanent for very dense problems
2008
Mark Huber
Jenny Law
+
Approximating the Permanent with Deep Rejection Sampling
2021
Juha Harviainen
Antti Röyskö
Mikko Koivisto
+
Approximating the Permanent with Deep Rejection Sampling
2021
Juha Harviainen
Antti Röyskö
Mikko Koivisto
Works That Cite This (0)
Action
Title
Year
Authors
Works Cited by This (0)
Action
Title
Year
Authors