Výsledky vyhledávání - "parameterized computational complexity"

Parameterized Computational Complexity of Dodgson and Young Elections

Autoři: Nadja Betzler Jiong Guo Rolf Niedermeier

Zdroj: Lecture Notes in Computer Science ISBN: 9783540699002

Témata: W[2]-completeness, Computational Theory and Mathematics, Winner determination, Fixed-parameter tractability, 0202 electrical engineering, electronic engineering, information engineering, Computational social choice, Voting systems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

Přístupová URL adresa: https://rd.springer.com/chapter/10.1007/978-3-540-69903-3_36
https://dblp.uni-trier.de/db/conf/swat/swat2008.html#BetzlerGN08
https://link.springer.com/chapter/10.1007%2F978-3-540-69903-3_36
http://fpt.akt.tu-berlin.de/publications/swat_stamped.pdf
https://link.springer.com/content/pdf/10.1007%2F978-3-540-69903-3_36.pdf

Parameterized computational complexity of control problems in voting systems

Autoři: Junfeng Luan Haodi Feng Daming Zhu a další

Zdroj: Theoretical Computer Science. 410:2746-2753

Témata: Parameterized complexity, Plurality voting, Condorcet voting, 0202 electrical engineering, electronic engineering, information engineering, Constructive control, Approval voting, Voting systems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Destructive control, Theoretical Computer Science, Computer Science(all)

Přístupová URL adresa: http://www.sciencedirect.com/science/article/pii/S0304397509003004
https://dblp.uni-trier.de/db/journals/tcs/tcs410.html#LiuFZL09
https://core.ac.uk/display/82094365
https://www.sciencedirect.com/science/article/pii/S0304397509003004

Parameterized computational complexity of finding small-diameter subgraphs

Autoři: Christian Komusiewicz Hannes Moser Rolf Niedermeier a další

Zdroj: Optimization Letters. 6:883-891

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://fpt.akt.tu-berlin.de/publications/sclub.pdf

A multivariate complexity analysis of the material consumption scheduling problem

Autoři: Bentert, Matthias Bredereck, Robert Györgyi, Péter a další

Zdroj: Journal of Scheduling. 26:369-382

Témata: FOS: Computer and information sciences, exact algorithms, számítógéptudomány, makespan minimization, Makespan minimization, Fine-grained complexity, 0211 other engineering and technologies, G.2.1, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Computer Science and Game Theory, fine-grained complexity, Non-renewable resources, Parameterized computational complexity, QA75 Electronic computers. Computer science / számítástechnika, ddc:650, I.2.8, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, parameterized computational complexity, I.1.2, 600 Technik, Medizin, angewandte Wissenschaften::650 Management, Öffentlichkeitsarbeit::650 Management und unterstützende Tätigkeiten, non-renewable resources, F.2.2, Exact algorithms, Computer Science and Game Theory (cs.GT)

Popis souboru: text

Přístupová URL adresa: http://arxiv.org/abs/2102.13642
https://hdl.handle.net/10419/309854
https://eprints.sztaki.hu/10249/
https://eprints.sztaki.hu/10557/

Parameterized computational complexity of Dodgson and Young elections

Autoři: Betzler, Nadja Guo, Jiong Niedermeier, Rolf

Zdroj: Information and Computation ; volume 208, issue 2, page 165-177 ; ISSN 0890-5401

Dostupnost: http://dx.doi.org/10.1016/j.ic.2009.10.001
https://api.elsevier.com/content/article/PII:S089054010900203X?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S089054010900203X?httpAccept=text/plain

A multivariate complexity analysis of the material consumption scheduling problem

Autoři: Bentert, Matthias Bredereck, Robert Györgyi, Péter a další

Témata: 600 Technik, Medizin, angewandte Wissenschaften::650 Management, Öffentlichkeitsarbeit::650 Management und unterstützende Tätigkeiten, non-renewable resources, makespan minimization, parameterized computational complexity, fine-grained complexity, exact algorithms

Popis souboru: application/pdf

Dostupnost: https://depositonce.tu-berlin.de/handle/11303/20657
https://doi.org/10.14279/depositonce-19455

Parameterized computational complexity of Dodgson and Young elections

Autoři: Nadja Betzler Jiong Guo Rolf Niedermeier a další

Přispěvatelé: Nadja Betzler Jiong Guo Rolf Niedermeier a další

Zdroj: http://theinf1.informatik.uni-jena.de/publications/swat_stamped.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.923

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.923
http://theinf1.informatik.uni-jena.de/publications/swat_stamped.pdf

The Role of Parameterized Computational Complexity Theory in Cognitive Modeling

Autoři: H. Todd Wareham The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: H. Todd Wareham The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.mun.ca/~harold/Papers/AAAI.ps.gz.

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.2251; http://www.cs.mun.ca/~harold/Papers/AAAI.ps.gz

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.2251
http://www.cs.mun.ca/~harold/Papers/AAAI.ps.gz

On coalitional manipulation for multiwinner elections: shortlisting

Autoři: Bredereck, Robert Kaczmarczyk, Andrzej Niedermeier, Rolf

Témata: 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, computational social choice, utility aggregation, strategic voting, parameterized computational complexity, tie-breaking, SNTV, bloc

Popis souboru: application/pdf

Dostupnost: https://depositonce.tu-berlin.de/handle/11303/18498
https://doi.org/10.14279/depositonce-17307

On Coalitional Manipulation for Multiwinner Elections: Shortlisting

Autoři: Robert Bredereck Andrzej Kaczmarczyk Rolf Niedermeier

Zdroj: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. :887-893

Témata: ddc:004, FOS: Computer and information sciences, Strategic voting, Computational Complexity (cs.CC), Tie-breaking, Computer Science - Computer Science and Game Theory, tie-breaking, Computer Science - Data Structures and Algorithms, Computer Science - Multiagent Systems, Data Structures and Algorithms (cs.DS), 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, utility aggregation, SNTV, Parameterized computational complexity, strategic voting, bloc, Computational social choice, parameterized computational complexity, computational social choice, 004 Informatik, 16. Peace & justice, Utility aggregation, Computer Science - Computational Complexity, Bloc, Multiagent Systems (cs.MA), Computer Science and Game Theory (cs.GT)

Popis souboru: application/pdf

Přístupová URL adresa: https://www.ijcai.org/proceedings/2017/0123.pdf
https://link.springer.com/content/pdf/10.1007/s10458-021-09507-9.pdf
http://arxiv.org/abs/1806.10460
https://www.ijcai.org/proceedings/2017/123
https://doi.org/10.24963/ijcai.2017/123
https://dblp.uni-trier.de/db/conf/ijcai/ijcai2017.html#BredereckKN17
http://arxiv.org/pdf/1806.10460.pdf
https://link.springer.com/article/10.1007/s10458-021-09507-9
https://link.springer.com/content/pdf/10.1007/s10458-021-09507-9.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1806.html#abs-1806-10460
https://arxiv.org/abs/1806.10460
https://www.ijcai.org/Proceedings/2017/123
http://edoc.hu-berlin.de/18452/27356
https://doi.org/10.18452/26663

Assessing the computational complexity of multilayer subgraph detection

Autoři: Bredereck, Robert Komusiewicz, Christian Kratsch, Stefan a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783319575858

Témata: ddc:004, FOS: Computer and information sciences, exact algorithms, multi-modal data, Discrete Mathematics (cs.DM), matching, G.2.1, parameterized computational complexity, G.2.2, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 004 Informatik, 16. Peace & justice, 01 natural sciences, I.1.2, Computer Science - Computational Complexity, F.2.2, Computer Science - Data Structures and Algorithms, Hamiltonian path, community detection, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://edoc.hu-berlin.de/bitstream/18452/22388/1/assessing_the_computational_complexity_of_multilayer_subgraph_detection.pdf
http://arxiv.org/abs/1604.07724
https://arxiv.org/abs/1604.07724
https://www.cambridge.org/core/journals/network-science/article/assessing-the-computational-complexity-of-multilayer-subgraph-detection/C42E572CC4811D9FA40EC2898716AE3A
https://arxiv.org/pdf/1604.07724v1
https://link.springer.com/chapter/10.1007/978-3-319-57586-5_12
https://rd.springer.com/chapter/10.1007%2F978-3-319-57586-5_12
https://dblp.uni-trier.de/db/journals/corr/corr1604.html#BredereckKKMNS16

On coalitional manipulation for multiwinner elections: shortlisting

Autoři: Bredereck, Robert Kaczmarczyk, Andrzej Niedermeier, Rolf

Témata: Computational social choice, Utility aggregation, Strategic voting, Parameterized computational complexity, Tie-breaking, SNTV, Bloc, 004 Informatik, ddc:004

Popis souboru: application/pdf

Relation: https://doi.org/10.18452/26663

Dostupnost: http://edoc.hu-berlin.de/18452/27356
https://nbn-resolving.org/urn:nbn:de:kobv:11-110-18452/27356-9
https://doi.org/10.18452/26663
https://doi.org/10.1007/s10458-021-09507-9

Parameterized computational complexity of finding small-diameter subgraphs

Autoři: Schäfer, A. Komusiewicz, C. Moser, H. a další

Zdroj: Optimization Letters

Popis souboru: application/pdf

Dostupnost: http://hdl.handle.net/11858/00-001M-0000-0011-F31A-5
http://hdl.handle.net/11858/00-001M-0000-000E-B76A-0

Assessing the computational complexity of multilayer subgraph detection

Autoři: Bredereck, Robert Komusiewicz, Christian Kratsch, Stefan a další

Témata: parameterized computational complexity, exact algorithms, multi-modal data, matching, Hamiltonian path, community detection, 004 Informatik, ddc:004

Popis souboru: application/pdf

Relation: https://doi.org/10.18452/21661

Dostupnost: http://edoc.hu-berlin.de/18452/22388
https://nbn-resolving.org/urn:nbn:de:kobv:11-110-18452/22388-1
https://doi.org/10.18452/21661
https://doi.org/10.1017/nws.2019.13

A generalization of Nemhauser and Trotterʼs local optimization theorem

Autoři: Fellows, Michael R. Guo, Jiong Moser, Hannes a další

Přispěvatelé: Fellows, Michael R. Guo, Jiong Moser, Hannes a další

Zdroj: Journal of Computer and System Sciences. 77:1141-1158

Témata: FOS: Computer and information sciences, Combinatorial optimization, Discrete Mathematics (cs.DM), Computer Networks and Communications, NP-hard problems, 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Theoretical Computer Science, Graph problems, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Polynomial-time data reduction, Graph algorithms, Parameterized computational complexity, computational complexity, Applied Mathematics, Computational complexity, W[2]-completeness, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computer Science - Computational Complexity, Computational Theory and Mathematics, Fixed-parameter tractability, fixed-parameter tractability, kernelization, Kernelization, combinatorial optimization, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ddc:004, graph problems, Algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/0902.2149
https://inria.hal.science/inria-00360058v1/document
https://inria.hal.science/inria-00360058v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1820

Index sets and parametric reductions

Autoři: Michael R. Fellows Rodney G. Downey

Zdroj: Archive for Mathematical Logic. 40:329-348

Témata: Complexity of computation (including implicit computational complexity), index sets, polynomial reducibilities, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), parameterized computational complexity, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://philpapers.org/rec/DOWISA
https://link.springer.com/article/10.1007/s001530100082
https://dblp.uni-trier.de/db/journals/aml/aml40.html#DowneyF01

The Relevance of Parameterized Computational Complexity Theory to Cognitive Modeling

Autoři: H. Todd Wareham The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: H. Todd Wareham The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.mun.ca/~harold/Posters/poster_AAAI.ps.gz.

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.4821; http://www.cs.mun.ca/~harold/Posters/poster_AAAI.ps.gz

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.4821
http://www.cs.mun.ca/~harold/Posters/poster_AAAI.ps.gz

Parameterized Computational Complexity of Finding Small-Diameter Subgraphs

Autoři: Alexander Schäfer Christian Komusiewicz Hannes Moser a další

Přispěvatelé: Alexander Schäfer Christian Komusiewicz Hannes Moser a další

Zdroj: http://fpt.akt.tu-berlin.de/publications/sclub.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.3072

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.3072
http://fpt.akt.tu-berlin.de/publications/sclub.pdf

The parameterized complexity of sequence alignment and consensus

Autoři: Rodney G. Downey Hans L. Bodlaender Harold T. Wareham a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540580942

Témata: longest common subsequence problem, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), parameterized computational complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: http://dspace.library.uu.nl/bitstream/1874/17345/1/bodlaender_95_the%20parameter.pdf
https://zbmath.org/1065141
https://doi.org/10.1016/0304-3975(94)00251-d
https://research-portal.uu.nl/en/publications/c6cf3a41-bbaa-4197-8379-ab488a15ac80
https://doi.org/10.1007/3-540-58094-8_2
https://research-portal.uu.nl/en/publications/c8954dca-9cb3-4b7e-a0d6-1d0f01c18593
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F17345
https://rd.springer.com/chapter/10.1007/3-540-58094-8_2
http://www.mrfellows.net/papers/BDFW95_SeqAlignment.pdf
http://dspace.library.uu.nl/bitstream/1874/17345/1/bodlaender_95_the%20parameter.pdf
https://link.springer.com/chapter/10.1007/3-540-58094-8_2
https://dblp.uni-trier.de/db/journals/tcs/tcs147.html#BodlaenderDFW95
https://dblp.uni-trier.de/db/conf/cpm/cpm94.html#BodlaenderDFW94
https://core.ac.uk/display/21435426

Perfect Code is W[1]-complete: Perfect Code is \(W[1]\)-complete

Autoři: Cesati M. Cesati, M

Přispěvatelé: Cesati M. Cesati, M

Zdroj: Information Processing Letters. 81:163-168

Témata: Computational complexity, Weighted Exact Conjunctive Normal Form Satisfiability, Analysis of algorithms and problem complexity, Perfect Code, Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI, 0102 computer and information sciences, 0101 mathematics, W[1]-completeness, 01 natural sciences, Parameterized computational complexity

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://doi.org/10.1016/S0020-0190(01)00207-1
https://dblp.uni-trier.de/db/journals/ipl/ipl81.html#Cesati02
https://doi.org/10.1016/S0020-0190(01)00207-1
https://www.sciencedirect.com/science/article/pii/S0020019001002071
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.158.5884&rep=rep1&type=pdf
https://doi.org/10.1016/S0020-0190(01)00207-1
https://hdl.handle.net/2108/260215