Výsledky vyhľadávania - "Output-polynomial algorithms"
-
1
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
https://hal.science/hal-02181721
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.16:1--16:12, ⟨10.4230/LIPIcs.STACS.2019.16⟩Predmety: triangle-free graphs, split graphs, minimal dominating set, output-polynomial algorithms, enumeration algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
2
Autori:
Zdroj: SIAM Journal on Computing. 32:514-537
Predmety: FOS: Computer and information sciences, combinatorial enumeration, Analysis of algorithms and problem complexity, Applications of graph theory, 0211 other engineering and technologies, G.2.1, G.2.2, 0102 computer and information sciences, 02 engineering and technology, dualization, Computational Complexity (cs.CC), Hypergraphs, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, treewidth, Data Structures and Algorithms (cs.DS), Boolean functions, hypergraph acyclicity, Database theory, output-polynomial algorithms, F.2.2, F.1.3, transversal computation, Computer Science - Computational Complexity, hypergraphs, Knowledge representation, Graph theory (including graph drawing) in computer science, Switching theory, application of Boolean algebra, limited nondeterminism
Popis súboru: application/xml
Prístupová URL adresa: http://arxiv.org/abs/cs/0204009
https://arxiv.org/pdf/cs/0204009
https://ui.adsabs.harvard.edu/abs/2002cs........4009E/abstract
http://portal.acm.org/citation.cfm?doid=509907.509912
http://www.kr.tuwien.ac.at/staff/eiter/et-archive/dual-stoc02.pdf
https://dblp.uni-trier.de/db/journals/corr/corr0204.html#cs-DS-0204009
https://www.cs.ox.ac.uk/publications/publication176-abstract.html
https://ora.ox.ac.uk/objects/uuid:08358504-8295-4044-add3-3e389c6cfa59
https://ora.ox.ac.uk/objects/uuid:0f8cffd0-f051-4deb-91a7-84054df48cc2
https://ora.ox.ac.uk/objects/uuid:6ad59704-11d2-497d-8fd1-3906bb0b7519
https://doi.org/10.1145/509907.509912 -
3
Autori:
Zdroj: Discrete Applied Mathematics. 156:2035-2049
Predmety: Self-duality, Limited nondeterminism, Dualization, Polynomial-total time, Output-polynomial algorithms, Applied Mathematics, 0211 other engineering and technologies, Set coverings, 0102 computer and information sciences, 02 engineering and technology, Hypergraphs, 01 natural sciences, Transversals, Independent sets, Discrete Mathematics and Combinatorics, Monotone Boolean functions, Quasi-polynomial time, Combinatorial enumeration, Hitting sets
Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/dam/dam156.html#EiterMG08
https://www.sciencedirect.com/science/article/pii/S0166218X07001278
http://dblp.uni-trier.de/db/journals/dam/dam156.html#EiterMG08
https://doi.org/10.1016/j.dam.2007.04.017
https://core.ac.uk/display/81120122
http://www.sciencedirect.com/science/article/pii/S0166218X07001278 -
4
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Dualization, Monotone Boolean Functions, Hypergraphs, Transversals, Hitting Sets, Independent Sets, Set Coverings, Self-duality, Output-polynomial Algorithms, Polynomial-total Time, Quasi-polynomial Time, Combinatorial Enumeration, Limited Nondeterminism
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.8214; http://www.kr.tuwien.ac.at/research/reports/rr0601.pdf
-
5
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Dualization, hypergraphs, transversal computation, output-polynomial algorithms, combinatorial enumeration, treewidth, hypergraph acyclicity
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.2582; http://arxiv.org/pdf/cs/0204009v2.pdf
-
6
Autori:
Prispievatelia:
Predmety: transversal computation, output-polynomial algorithms, combinatorial enumeration, treewidth, hypergraph
Popis súboru: application/pdf
-
7
Autori: a ďalší
Zdroj: SIAM Journal on Computing; 2022, Vol. 51 Issue 5, p1580-1625, 46p
-
8
Autori:
Zdroj: Mathematics of Operations Research; Feb2022, Vol. 47 Issue 1, p812-846, 35p
Predmety: COST functions, MATRIX multiplications, CONVEX functions, COST
-
9
-
10
Autori: a ďalší
Zdroj: Algorithmica; Feb2018, Vol. 80 Issue 2, p714-741, 28p
-
11
Autori: a ďalší
Zdroj: Graph-Theoretic Concepts in Computer Science: 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers; 2016, p138-153, 16p
-
12
Autori: a ďalší
Zdroj: Lecture Notes in Computer Science; 2017, p289-302, 14p
-
13
Autori: a ďalší
Zdroj: Algorithms & Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings; 2015, p248-258, 11p
-
14
Autori: a ďalší
Zdroj: Algorithms & Data Structures (9783319218397); 2015, p446-457, 12p
-
15
Autori: a ďalší
Zdroj: Automata, Languages & Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I; 2014, p64-76, 13p
-
16
Autori:
Zdroj: Computer Vision - ACCV 2012; 2013, p120-133, 14p
-
17
Autori: a ďalší
Zdroj: Inhibitory Rules in Data Analysis; 2009, p9-29, 21p
-
18
Autori: a ďalší
Zdroj: Algorithmica; Jul2015, Vol. 72 Issue 3, p836-859, 24p
-
19
Autori: a ďalší
Zdroj: ACM Transactions on Database Systems; Nov2013, Vol. 38 Issue 4, p1-45, 45p
-
20
Autori: Bhagat, Nitin S.
Zdroj: IEEE Systems Journal; Dec2009, Vol. 3 Issue 4, p536-543, 8p
Nájsť tento článok vo Web of Science
Full Text Finder