ℹ️
🇬🇧
Search
Search for publications relevant for "polynomial time"
polynomial time
Publication
Class
Person
Publication
Programmes
publication
Comparing universal covers in polynomial time
+2
2008 |
Faculty of Mathematics and Physics
publication
A subclass of Horn CNFs optimally compressible in polynomial time
2010 |
Faculty of Mathematics and Physics
publication
Thin graph classes and polynomial-time approximation schemes
2018 |
Faculty of Mathematics and Physics
publication
Polynomial-time sortable stacks of burnt pancakes
2011 |
Faculty of Mathematics and Physics
publication
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
2020 |
Faculty of Mathematics and Physics
publication
Pivoting in linear complementarity: Two polynomial-time cases
2009 |
Faculty of Mathematics and Physics
publication
Polynomial-time algorithm for fixed points of nontrivial morphisms
2009 |
Faculty of Mathematics and Physics
publication
Polynomial time approximation schemes for clustering in low highway dimension graphs
+1
2020 |
Faculty of Mathematics and Physics
publication
Detecting induced star-like minors in polynomial time
2012 |
Faculty of Mathematics and Physics
publication
Polynomial-Time Homology for Simplicial Eilenberg-MacLane Spaces
2013 |
Faculty of Mathematics and Physics
publication
Some classes of Boolean formulae with polynomial time satisfiability testing.
2002 |
Publication without faculty affiliation
publication
Baker game and polynomial-time approximation schemes
2020 |
Faculty of Mathematics and Physics
publication
POLYNOMIAL-TIME COMPUTATION OF HOMOTOPY GROUPS AND POSTNIKOV SYSTEMS IN FIXED DIMENSION
2014 |
Faculty of Mathematics and Physics
publication
A polynomial time algorithm for single machine multislot just-in-time scheduling problem.
2003 |
Faculty of Mathematics and Physics
publication
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
2019 |
Faculty of Mathematics and Physics
publication
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs
2022 |
Faculty of Mathematics and Physics
publication
Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies
2008 |
Faculty of Mathematics and Physics
publication
On polynomial-time combinatorial algorithms for maximum L-bounded flow
2019 |
Faculty of Mathematics and Physics
publication
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time
2023 |
Faculty of Mathematics and Physics
publication
The k-in-a-Path Problem for Claw-free Graphs
2012 |
Faculty of Mathematics and Physics
publication
Cubic plane graphs on a given point set
2015 |
Faculty of Mathematics and Physics
publication
Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor
2023 |
Faculty of Mathematics and Physics
publication
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
2017 |
Faculty of Mathematics and Physics
publication
Graph isomorphism restricted by lists
2021 |
Faculty of Mathematics and Physics
publication
Boolean functions with long prime implicants
2012 |
Faculty of Mathematics and Physics
publication
It is tough to be a plumber
2004 |
Faculty of Mathematics and Physics, Central Library of Charles University
publication
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
2004 |
Faculty of Mathematics and Physics