Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 7310066

From MaRDI portal
Publication:5150410
Jump to:navigation, search

zbMath1477.68129MaRDI QIDQ5150410

Valentina Vladimirovna Bykova

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm274

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityparameterized algorithmselasticity of algorithms


Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01) Parameterized complexity, tractability and kernelization (68Q27)


Related Items

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item



Cites Work

  • On the complexity of database queries
  • Fixed-parameter complexity in AI and nonmonotonic reasoning
  • The Turing way to parameterized complexity
  • Parametrized complexity theory.
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5150410&oldid=19705147"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 16:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki