Pages that link to "Item:Q1098837"
From MaRDI portal
The following pages link to Some observations on the connection between counting and recursion (Q1098837):
Displaying 16 items.
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- On closure properties of GapP (Q1337146) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- Decidable and expressive classes of probabilistic automata (Q1740668) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- The operators min and max on the polynomial hierarchy (Q5047162) (← links)
- The Complexity of Homomorphism Indistinguishability (Q5092416) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY (Q5249042) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
