The following pages link to Johannes Köbler (Q259078):
Displaying 23 items.
- New collapse consequences of NP having small circuits (Q4645178) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- (Q4736833) (← links)
- ON HELPING AND INTERACTIVE PROOF SYSTEMS (Q4853334) (← links)
- On the power of generalized Mod-classes (Q4864444) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
- Interval Graph Representation with Given Interval and Intersection Lengths (Q4909568) (← links)
- (Q4967195) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- Graph isomorphism is low for PP (Q5096798) (← links)
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
- On Hypergraph and Graph Isomorphism with Bounded Color Classes (Q5449815) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5896136) (← links)
- Logical Approaches to Computational Barriers (Q5898822) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5919354) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925678) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)
