The following pages link to Klaus W. Wagner (Q675063):
Displayed 50 items.
- Item:Q675063 (redirect page) (← links)
- Item:Q198597 (redirect page) (← links)
- On the power of DNA-computing (Q675064) (← links)
- The binary network flow problem is logspace complete for P (Q914388) (← links)
- The Boolean hierarchy of NP-partitions (Q924719) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- Two-way automata with more than one storage medium (Q1083206) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- On the intersection of the class of linear context-free languages and the class of single-reset languages (Q1094883) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- More complicated questions about maxima and minima, and some closures of NP (Q1107524) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- Bounding queries in the analytic polynomial-time hierarchy (Q1274987) (← links)
- Probabilistic type-2 operators and ``almost''-classes (Q1277097) (← links)
- Introduction to theoretical computer science. Foundations and models (Q1336487) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- The chain method to separate counting classes (Q1384716) (← links)
- Theoretical informatics. A compact introduction (Q1405802) (← links)
- Complexity classes of optimization functions (Q1898460) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- The complexity of membership problems for circuits over sets of natural numbers (Q2474202) (← links)
- Generation problems (Q2575749) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
- (Q2709238) (← links)
- (Q3217604) (← links)
- (Q3314998) (← links)
- (Q3340147) (← links)
- (Q3340148) (← links)
- (Q3340149) (← links)
- (Q3359769) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- Bounded Query Classes (Q3495646) (← links)
- (Q3505897) (← links)
- Complexity of Aperiodicity for Topological Properties of Regular ω-Languages (Q3507470) (← links)
- Complexity of Topological Properties of Regular ω-Languages (Q3533038) (← links)
- The Complexity of Unions of Disjoint Sets (Q3590939) (← links)
- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy (Q3617079) (← links)
- (Q3681937) (← links)
- (Q3707407) (← links)
- (Q3707408) (← links)
- (Q3759947) (← links)
- (Q3766851) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- (Q3777484) (← links)
- The difference and truth-table hierarchies for NP (Q3783278) (← links)
- (Q3793733) (← links)
- (Q3795231) (← links)
- The computational complexity of graph problems with succinct multigraph representation (Q3801600) (← links)
- The Boolean Hierarchy I: Structural Properties (Q3832042) (← links)
- The Boolean Hierarchy II: Applications (Q3832043) (← links)