Pages that link to "Item:Q3893305"
From MaRDI portal
The following pages link to Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations (Q3893305):
Displaying 21 items.
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Optimal advice (Q672755) (← links)
- On measuring nondeterminism in regular languages (Q912641) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- On finding a minimum dominating set in a tournament (Q1113678) (← links)
- On the relation between ambiguity and nondeterminism in finite automata (Q1198953) (← links)
- Nondeterministics circuits, space complexity and quasigroups (Q1318692) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- On problems with short certificates (Q1338895) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Measuring nondeterminism in pushdown automata (Q2575832) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- Polynomial-time reducibilities and ``almost all'' oracle sets (Q2639849) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
