ℹ️
🇬🇧
Search
Search for publications relevant for "NPS"
NPS
Publication
Class
Person
Publication
Programmes
Export current view
publication
Up to date experience in work with NPS users in the Czech Republic and abroad
2015 |
First Faculty of Medicine
publication
Dosavadní zkušenosti v práci s uživateli NPS v ČR a v zahraničí
2015 |
Third Faculty of Medicine
publication
Shellability is NP-complete
+1
2018 |
Faculty of Mathematics and Physics
publication
Patient Safety in the UK
2008 |
Third Faculty of Medicine
publication
Embeddability in R3 is NP-hard
2018 |
Faculty of Mathematics and Physics
publication
Recognition of Collapsible Complexes is NP-Complete
2016 |
Faculty of Mathematics and Physics
publication
Embeddability in R-3 is NP-hard
2020 |
Faculty of Mathematics and Physics
publication
IV-matching is strongly NP-hard
2017 |
Faculty of Mathematics and Physics
publication
Switching to Hedgehog-Free Graphs is NP-Complete
2011 |
Faculty of Mathematics and Physics
publication
Three NP-Complete Optimization Problems in Seidel's Switching
2008 |
Faculty of Mathematics and Physics
publication
Ichtyofauna of selected streams in the NP and PLA Šumava.
Publication without faculty affiliation
publication
Recommendations for methods of work with users of new psychoactive substances in the Czech Republic
2015 |
First Faculty of Medicine
publication
The ratio Rdp of the quasi-elastic nd-(nn)p to the elastic np-np charge-exchange differential cross sections over the 0.8-2.0GeV neutron beam energy interval.
2006 |
Faculty of Mathematics and Physics
publication
d-collapsibility is NP complete for d greater or equal to 4
2010 |
Faculty of Mathematics and Physics
publication
NP-HARDNESS OF COMPUTING PL GEOMETRIC CATEGORY IN DIMENSION
2023 |
Faculty of Mathematics and Physics
publication
d-collapsibility is NP-complete for d greater or equal to 4
2009 |
Faculty of Mathematics and Physics
publication
Search for the NN -} 6q phase transition in the np-polarized measurements at Tkin =1-6 GeV.
2008 |
Faculty of Mathematics and Physics
publication
Subset Synchronizability in Eulerian Automata Is NP-Hard
2014 |
Faculty of Mathematics and Physics
publication
Recognition of Polygon-circle Graphs and Graphs of Interval Filaments is NP-complete
+1
2007 |
Faculty of Mathematics and Physics
publication
NP for combinatorialists
2007 |
Faculty of Mathematics and Physics
publication
A Suspicion Index to aid screening of early-onset Niemann-Pick disease Type C (NP-C)
2016 |
First Faculty of Medicine
publication
The abiotic diversity assessment and its impact on habitat diversity in the Šumava NP a Křivoklátsko PLA
2008 |
Faculty of Science
publication
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-complete
+1
2007 |
Faculty of Mathematics and Physics
publication
NP by Means of Lifts and Shadows
+1
2007 |
Faculty of Mathematics and Physics
publication
Methods of abiotic diversity assessment and its relation to habitat diversity in the Šumava NP a Křivokátsko PLA
2008 |
Faculty of Science
publication
Documentation of the development of CR on the example of NP
2000 |
Faculty of Science