Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displaying 50 items.
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On the Pólya permanent problem over finite fields (Q607375) (← links)
- Optical solution for hard on average \#P-complete instances (using exponential space for solving instances of the permanent) (Q609025) (← links)
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
- Matching signatures and Pfaffian graphs (Q626770) (← links)
- A relation-algebraic approach to simple games (Q631101) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- The factorization of the permanent of a matrix with minimal rank in prime characteristic (Q663475) (← links)
- Per-spectral characterizations of bicyclic networks (Q670450) (← links)
- A theory of even functionals and their algorithmic applications (Q672856) (← links)
- Independent sets versus perfect matchings (Q673116) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- Mathematical aspects of concept analysis (Q676803) (← links)
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
- A permanent formula for the Jones polynomial (Q719783) (← links)
- Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Counting and sampling SCJ small parsimony solutions (Q740977) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- On the permanental polynomials of matrices (Q745925) (← links)
- Almost all trees are co-immanantal (Q751666) (← links)
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- Bernoulli measure on strings, and Thompson-Higman monoids. (Q766121) (← links)
- New permanent approximation inequalities via identities (Q779828) (← links)
- Computing expectations and marginal likelihoods for permutations (Q782657) (← links)
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- On the succinct representation of graphs (Q800734) (← links)
- On the complexity of counting in the polynomial hierarchy (Q808260) (← links)
- A note on enumerative counting (Q809598) (← links)
- Similarity of personal preferences: Theoretical foundations and empirical analysis (Q814460) (← links)
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917) (← links)
- Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
