Pages that link to "Item:Q600247"

The following pages link to The complexity of computing the permanent (Q600247):

Displaying 50 items.

• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• Tensor network contractions for \#SAT (Q887094) (← links)
• The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
• An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
• The complexity of determinacy problem on group testing (Q913514) (← links)
• NP-completeness of some problems concerning voting games (Q918448) (← links)
• On the complexity of ranking (Q920620) (← links)
• The computational complexity of evolutionarily stable strategies (Q926196) (← links)
• New complexity results about Nash equilibria (Q932810) (← links)
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
• A relationship between subpermanents and the arithmetic-geometric mean inequality (Q958001) (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
• On the counting complexity of propositional circumscription (Q963360) (← links)
• Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
• Robust self-assembly of graphs (Q968405) (← links)
• On the autoreducibility of functions (Q970103) (← links)
• The parameterized complexity of probability amplification (Q975525) (← links)
• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (Q976088) (← links)
• On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
• Counting complexity of propositional abduction (Q988576) (← links)
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
• Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices (Q999813) (← links)
• The complexity of power-index comparison (Q1001906) (← links)
• Computing small partial coverings (Q1007552) (← links)
• Dimers on graphs in non-orientable surfaces (Q1013634) (← links)
• Inclusion-exclusion for \(k\)-CNF formulas (Q1014406) (← links)
• The counting complexity of a simple scheduling problem (Q1038110) (← links)
• On counting 3-D matchings of size \(k\) (Q1040648) (← links)
• The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
• Theory of one-tape linear-time Turing machines (Q1041220) (← links)
• Monomial bases for broken circuit complexes (Q1041597) (← links)
• Computing sparse permanents faster (Q1044712) (← links)
• Inequalities and identities for generalized matrix functions (Q1057339) (← links)
• Graph isomorphism problem (Q1057883) (← links)
• The complexity of counting homeomorphs (Q1058852) (← links)
• On some natural complete operators (Q1064780) (← links)
• Games against nature (Q1069296) (← links)
• Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
• An analysis of Monte Carlo algorithms for counting problems (Q1083200) (← links)
• On the computational complexity of the order polynomial (Q1086595) (← links)
• Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
• NP is as easy as detecting unique solutions (Q1090454) (← links)
• The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
• Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) (← links)
• Permanent and determinant (Q1097929) (← links)
• Some observations on the connection between counting and recursion (Q1098837) (← links)
• The complexity of optimization problems (Q1107309) (← links)
• Parallel computation with threshold functions (Q1107324) (← links)
• Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)