Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displayed 50 items.
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- On counting problems and the polynomial-time hierarchy (Q1171880) (← links)
- Approximate inclusion-exclusion (Q1174115) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Counting linear extensions (Q1183942) (← links)
- Restricted relativizations of probabilistic polynomial time (Q1186606) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Counting propositional models (Q1197995) (← links)
- A note on the permanent value problem (Q1198001) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On the power of enumerative counting (Q1199550) (← links)
- Approximating the permanent of graphs with large factors (Q1199692) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- On the closure of certain function classes under integer division by polynomially-bounded functions (Q1208441) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- A note on the determinant and permanent problem (Q1263283) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316) (← links)
- The determinant of a fuzzy matrix with respect to \(t\) and co-\(t\) norms (Q1278896) (← links)
- Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents (Q1285571) (← links)
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- Iterates of fuzzy circulant matrices (Q1319440) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- Extending matchings in claw-free graphs (Q1322284) (← links)
- A note on SpanP functions (Q1328756) (← links)
- On the relationship between \(\varepsilon\)-biased random variables and \(\varepsilon\)-dependent random variables (Q1328759) (← links)
- Resolving contradictions: A plausible semantics for inconsistent systems (Q1332637) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- Symmetries of plane partitions and the permanent-determinant method (Q1336443) (← links)
- Algorithms to count paths and cycles (Q1339379) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- The complexities of the coefficients of the Tutte polynomial (Q1346689) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- On the permanent of certain \((0,1)\) Toeplitz matrices (Q1373310) (← links)
- A \(q\)-analog of approximation inclusion-exclusion (Q1383437) (← links)
- Computing the permanent by importance sampling method. (Q1385764) (← links)
- Comparison of permanental bounds of \((0,1)\)-matrices (Q1392571) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- On the number of different permanents of some sparse (0,1)-circulant matrices. (Q1414708) (← links)
- An upper bound for the permanent of \((0,1)\)-matrices. (Q1418984) (← links)
- On the hardness of counting problems of complete mappings. (Q1426113) (← links)