Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

固定パラメータ容易性 · Vinony

🌐日本語

English Deutsch Español Français Polski Português Русский 中文日本語

EntityQ1570441· pop 7· linked from 157 articles

固定パラメータ容易性

branch of computational complexity theory

Available in 7 languages

Español
Français
Deutsch
中文
Português
zh_yue

via Wikidata sitelinks · CC0

Connections

P versus NP problem

first-order logic

Categories

Computational complexity theory Parameterized complexity

Sources

wikipedia.externallinksexternallink

What links here157 pages

P versus NP problem

2-satisfiability

planar separator theorem

combinatorial optimization

graph homomorphism

bipartite graph

Feedback arc set

No-three-in-line problem

branch-decomposition

computational complexity theory

time complexity

cyclomatic number

exponential time hypothesis

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Circuit complexity

Entitydist 0.30

Entitydist 0.39

branch and bound

Entitydist 0.45

computational geometry

Entitydist 0.48

computational chemistry

Entitydist 0.57

Lamé's theorem

Entitydist 0.59

Entitydist 0.62

Entitydist 0.62

systems biology

Entitydist 0.65

École des technologies numériques avancées

Entitydist 0.65

𝑛th root algorithm

Entitydist 0.67

root-finding algorithm

Entitydist 0.67

time complexity

Entity

computer science

International Standard Book Number

digital object identifier

International Standard Serial Number

De Morgan's laws

monotonic function

computational complexity theory

boolean satisfiability problem

Sign in to save