Výsledky vyhľadávania - "parameterized complexity theory"

Homology localization through the looking-glass of parameterized complexity theory

Autori: Nello Blaser Erlend Raa Vågset

Zdroj: Journal of Applied and Computational Topology. 9

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, F.2.2, F.1.3, 55-08 (primary) 68Q27, 68Q17 (Secondary), 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Computer Science - Computational Geometry, Algebraic Topology (math.AT), Mathematics - Algebraic Topology

Prístupová URL adresa: http://arxiv.org/abs/2011.14490

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

Autori: Roth, M Wellnitz, P

Zdroj: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ISBN: 9781611975994

Predmety: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Discrete Mathematics

Prístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.133
http://arxiv.org/abs/1907.03850
http://arxiv-export-lb.library.cornell.edu/abs/1907.03850
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-03850
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3188371

Homology Localization Through the Looking-Glass of Parameterized Complexity Theory

Autori: Blaser, Nello Vågset, Erlend Raa

Témy: Computer Science - Computational Geometry, Computer Science - Computational Complexity, Mathematics - Algebraic Topology, 55-08 (primary) 68Q27, 68Q17 (Secondary), F.2.2, F.1.3, text

URL: http://arxiv.org/abs/2011.14490

Parameterized Complexity Theory

Autori: Ronald de Haan

Zdroj: Lecture Notes in Computer Science ISBN: 9783662606698

Prístupová URL adresa: https://link.springer.com/chapter/10.1007%2F978-3-662-60670-4_3

Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

Autori: de Haan, R.

Zdroj: Lecture Notes in Computer Science ISBN: 9783662606698

Prístupová URL adresa: https://hdl.handle.net/11245.1/9ac67751-0272-4f37-8eb0-3d0c95d19776
https://dare.uva.nl/personal/pure/en/publications/parameterized-complexity-in-the-polynomial-hierarchy(9ac67751-0272-4f37-8eb0-3d0c95d19776).html
https://doi.org/10.1007/978-3-662-60670-4
https://www.narcis.nl/publication/RecordID/oai%3Adare.uva.nl%3Apublications%2F9ac67751-0272-4f37-8eb0-3d0c95d19776

Parameterized Complexity Theory

Autori: J. Flum M. Grohe

Typ zdroja: eBook.

Predmet: Computational complexity, Algorithms

Kategórie: COMPUTERS / Computer Architecture, COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, COMPUTERS / Hardware / General, MATHEMATICS / Logic

On miniaturized problems in parameterized complexity theory

Autori: Chen, Yijia Flum, Jörg

Zdroj: Lecture Notes in Computer Science ISBN: 9783540230717

Predmety: Parameterized complexity, Fagin-definability, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Subexponential algorithms, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: http://basics.sjtu.edu.cn/~chen/papers/mini.pdf
https://link.springer.com/chapter/10.1007%2F978-3-540-28639-4_10
https://dblp.uni-trier.de/db/conf/iwpec/iwpec2004.html#ChenF04
https://dblp.uni-trier.de/db/journals/tcs/tcs351.html#ChenF06
https://www.sciencedirect.com/science/article/pii/S0304397505006274
https://link.springer.com/chapter/10.1007%2F978-3-540-28639-4_10
https://core.ac.uk/display/81931891
https://rd.springer.com/chapter/10.1007%2F978-3-540-28639-4_10
http://basics.sjtu.edu.cn/~chen/papers/mini.pdf

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

Autori: Roth, Marc Wellnitz, Philip

Témy: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1907.03850

Bounded nondeterminism and alternation in parameterized complexity theory

Autori: Chen, Yijia Flum, Jörg Grohe, Martin

Zdroj: 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.. :13-29

Predmety: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Prístupová URL adresa: http://basics.sjtu.edu.cn/~chen/papers/uwp.pdf
https://ieeexplore.ieee.org/document/1214407/
https://doi.org/10.1109/CCC.2003.1214407
https://dblp.uni-trier.de/db/conf/coco/coco2003.html#ChenF03
http://ieeexplore.ieee.org/document/1214407/
http://basics.sjtu.edu.cn/~chen/papers/uwp.pdf

Relativization and Interactive Proof Systems in Parameterized Complexity Theory

Autori: Bottesch, Ralph Ralph Bottesch

Prispievatelia: Bottesch, Ralph Ralph Bottesch

Zdroj: arXiv: Computational Complexity.

Predmety: FOS: Computer and information sciences, Parameterized complexity, Relativization, Computer Science - Computational Complexity, Interactive Proof Systems, F.1.2, 0102 computer and information sciences, ddc:004, F.1.3, Computational Complexity (cs.CC), 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1706.09391
https://arxiv.org/pdf/1706.09391.pdf
https://arxiv.org/abs/1706.09391
http://ui.adsabs.harvard.edu/abs/2017arXiv170609391B/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.9

Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects

Autori: Keung Ma Kin William I. Gasarch

Zdroj: The Computer Journal. 51:137-140

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/cj/cj51.html#GasarchK08
https://academic.oup.com/comjnl/article-abstract/51/1/137/504385

An Isomorphism Between Subexponential and Parameterized Complexity Theory

Autori: Yijia Chen Martin Grohe

Zdroj: SIAM Journal on Computing. 37:1228-1258

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: http://basics.sjtu.edu.cn/~chen/papers/isosiam.pdf
http://basics.sjtu.edu.cn/~chen/papers/isosiam.pdf
https://dblp.uni-trier.de/db/conf/coco/coco2006.html#ChenG06
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001663747

Machine-based methods in parameterized complexity theory

Autori: Martin Grohe Yijia Chen Jörg Flum

Zdroj: Theoretical Computer Science. 339:167-199

Predmety: Parameterized complexity, Machine characterizations, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, Complexity classes, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Popis súboru: application/xml

Counting Subgraphs in Somewhere Dense Graphs

Autori: Marco Bressan Leslie Ann Goldberg Kitty Meeks a ďalší

Prispievatelia: Marco Bressan Leslie Ann Goldberg Kitty Meeks a ďalší

Zdroj: SIAM Journal on Computing. 53:1409-1438

Predmety: 0301 basic medicine, FOS: Computer and information sciences, parameterised complexity theory, counting problems, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, somewhere dense graphs, Computer Science - Computational Complexity, 03 medical and health sciences, parameterized complexity theory, ddc:004, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2209.03402
https://ora.ox.ac.uk/objects/uuid:ec3d7a28-7134-415f-8d64-4aa422b7edaf
https://doi.org/10.1137/22m1535668
https://drops.dagstuhl.de/opus/volltexte/2023/17530/pdf/LIPIcs-ITCS-2023-27.pdf
https://hdl.handle.net/2434/961285
https://doi.org/10.4230/lipics.itcs.2023.27
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.27

Relativization and Interactive Proof Systems in Parameterized Complexity Theory

Autori: Bottesch, Ralph

Témy: Parameterized complexity, Relativization, Interactive Proof Systems, Data processing Computer science, InProceedings, publishedVersion

Homology localization through the looking-glass of parameterized complexity theory.

Autori: Blaser, Nello Vågset, Erlend Raa

Zdroj: Journal of Applied & Computational Topology; Jun2025, Vol. 9 Issue 2, p1-31, 31p

Parameterized Complexity Theory J. Flum M. Grohe

Zdroj: The Bulletin of Symbolic Logic, 2007 Jun 01. 13(2), 246-248.

Relation: Parameterized Complexity Theory J. Flum M. Grohe

Prístupová URL adresa: https://www.jstor.org/stable/4491347

J. Flum and M. Grohe. Parameterized complexity theory. Texts in Theoretical Computer Science. Springer, Berlin, 2006, xiii + 493 pp

Autori: Thomas Schwentick

Zdroj: Bulletin of Symbolic Logic. 13:246-248

Predmety: 0101 mathematics, 01 natural sciences

Prístupová URL adresa: https://www.cambridge.org/core/journals/bulletin-of-symbolic-logic/article/j-flum-and-m-grohe-parameterized-complexity-theory-texts-in-theoretical-computer-science-springer-berlin-2006-xiii-493-pp/20E7DD0381A916ABB0AF6672998DC4F3

Parameterized complexity theory / J. Flum, M. Grohe.

Autori: Flum, Jörg. Grohe, Martin. Springer Science+Business Media. pbl

Prispievatelia: Flum, Jörg. Grohe, Martin. Springer Science+Business Media. pbl

Zdroj: Bibliogr. s. [463]-475. Indeks.

Predmety: Złożoność obliczeniowa (informatyka), Algorytmy

Prístupová URL adresa: http://katalog.nukat.edu.pl/lib/item?id=chamo:2716034&theme=nukat

PARAMETERIZED COMPLEXITY THEORY

Autori: Rolf Niedermeier

Zdroj: Invitation to Fixed-Parameter Algorithms ISBN: 0198566077