The following pages link to Johannes Köbler (Q259078):
Displaying 46 items.
- (Q197719) (redirect page) (← links)
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Interval graph representation with given interval and intersection lengths (Q491160) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- Proof systems that take advice (Q553297) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- If NP has polynomial-size circuits, then MA=AM (Q674343) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- On counting and approximation (Q1114675) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- The power of the middle bit of a \(\#\)P function (Q1894453) (← links)
- Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
- Local WL invariance and hidden shades of regularity (Q2235273) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Corrigendum to ``Completeness results for graph isomorphism'' (Q2495413) (← links)
- A general dimension for query learning (Q2641869) (← links)
- On the Isomorphism Problem for Decision Trees and Decision Lists (Q2842768) (← links)
- Helly Circular-Arc Graph Isomorphism Is in Logspace (Q2849949) (← links)
- COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable (Q2908862) (← links)
- Approximate Graph Isomorphism (Q2912712) (← links)
- Solving Linear Equations Parameterized by Hamming Weight (Q2946006) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
- On the Power of Color Refinement (Q2947892) (← links)
- Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace (Q2957515) (← links)
- Canonizing Hypergraphs under Abelian Group Action (Q3087970) (← links)
- Interval Graphs: Canonical Representations in Logspace (Q3115868) (← links)
- The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
- (Q3396584) (← links)
- The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs (Q4608571) (← links)
- Parameterized Complexity of Small Weight Automorphisms. (Q4636604) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)
