Cites work
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3557236 (Why is no real title available?)
- scientific article; zbMATH DE number 3569828 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A characterization of convertible (0,1)-matrices
- A lower bound on the number of additions in monotone computations
- A method for obtaining digital signatures and public-key cryptosystems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Algorithm for Distinct Representatives
- Every Prime Has a Succinct Certificate
- Gaussian elimination is not optimal
- On the computational power of pushdown automata
- On the relation between the determinant and the permanent
- Relative complexity of checking and evaluating
- The Complexity of Enumeration and Reliability Problems
- The complexity of theorem-proving procedures
- The polynomial-time hierarchy
Cited in
(only showing first 100 items - show all)- The complexity of computational problems about Nash equilibria in symmetric win-lose games
- The time complexity of permutation routing via matching, token swapping and a variant
- Non-deterministic Weighted Automata on Random Words
- The complexity of approximating bounded-degree Boolean \(\#\)CSP
- On testing monomials in multivariate polynomials
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Counting and enumeration complexity with application to multicriteria scheduling
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
- Approximate set union via approximate randomization
- Approximate set union via approximate randomization
- The regularity lemma is false over small fields
- Odd \(K_{3,3}\) subdivisions in bipartite graphs
- Computing the permanent by importance sampling method.
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Counting restricted homomorphisms via Möbius inversion over matroid lattices
- A loop-free algorithm for generating the linear extensions of a poset
- Counting edge-injective homomorphisms and matchings on restricted graph classes
- Unification algorithms cannot be combined in polynomial time.
- On the permanental nullity and matching number of graphs
- Fast computation by block permanents of cumulative distribution functions of order statistics from several populations
- On the computational complexity of the order polynomial
- Approximation to measurable functions and its relation to probabilistic computation
- A duality between Boolean functions
- scientific article; zbMATH DE number 7250147 (Why is no real title available?)
- Expressing polynomials as the permanent of low rank square matrices
- Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
- On deterministic approximation of DNF
- Construction of smooth convex extensions of Boolean functions
- Counting kernels in directed graphs with arbitrary orientations
- A complexity theory of constructible functions and sheaves
- The operators min and max on the polynomial hierarchy
- Optimization problem in multi-homogeneous homotopy method
- Maximal independent sets in grid graphs
- Parameterized counting problems
- Some results on certain generalized circulant matrices
- The graph isomorphism problem and approximate categories
- Permanent and determinant
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- Sampling Edge Covers in 3-Regular Graphs
- The scaling mean and a law of large permanents
- Approximately counting approximately-shortest paths in directed acyclic graphs
- A dichotomy for real weighted Holant problems
- The complexity of estimating min-entropy
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- A Dichotomy Theorem for Polynomial Evaluation
- Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- The complexity of ranking simple languages
- SELF-SPECIFYING MACHINES
- Arithmetization: A new method in structural complexity theory
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- On the frontiers of polynomial computations in tropical geometry
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
- On the hardness of the noncommutative determinant
- Hard Enumeration Problems in Geometry and Combinatorics
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- New upper bound for the \#3-SAT problem
- On unique graph 3-colorability and parsimonious reductions in the plane
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
- Some observations on the connection between counting and recursion
- Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
- The structure and complexity of Nash equilibria for a selfish routing game
- The time complexity of the token swapping problem and its parallel variants
- Finding all maximally-matchable edges in a bipartite graph
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- The expected characteristic and permanental polynomials of the random Gram matrix
- Algorithms to count paths and cycles
- Majorization and the time complexity of linear optical networks
- Volume of convex polytopes equals mixed volume of simplices
- On the Pólya permanent problem over finite fields
- Per-spectral characterizations of graphs with extremal per-nullity
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?
- Feasible arithmetic computations: Valiant's hypothesis
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
- Robust self-assembly of graphs
- Proper colorability of segment intersection graphs
- Approximately counting paths and cycles in a graph
- Descriptive complexity of \#P functions: a new perspective
- Lifted algorithms for symmetric weighted first-order model sampling
- Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits
- On the existence and properties of convex extensions of Boolean functions
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Revisiting stochastic loss networks: structures and approximations
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- Many associated primes of powers of primes
- Combinatorial properties of Farey graphs
- Graph classes and the switch Markov chain for matchings
- On the set of stable matchings in a bipartite graph
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- Approximation theorems for random permanents and associated stochastic processes
- A very hard log-space counting class
- On preprocessing techniques and their impact on propositional model counting
- Singular values of Gaussian matrices and permanent estimators
- Affine projections of symmetric polynomials.
- Characterizing properties of permanental polynomials of lollipop graphs
This page was built for publication: The complexity of computing the permanent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600247)
