Suchergebnisse - "Parameterized computational complexity"
-
1
Autoren: et al.
Quelle: Journal of Scheduling. 26:369-382
Schlagwörter: 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)
Dateibeschreibung: text
-
2
Autoren:
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
3
Autoren: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
4
Autoren:
Quelle: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. :887-893
Schlagwörter: 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)
Dateibeschreibung: application/pdf
Zugangs-URL: 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 -
5
Autoren: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9783319575858
Schlagwörter: 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
Dateibeschreibung: application/pdf
Zugangs-URL: 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 -
6
Autoren:
Schlagwörter: Computational social choice, Utility aggregation, Strategic voting, Parameterized computational complexity, Tie-breaking, SNTV, Bloc, 004 Informatik, ddc:004
Dateibeschreibung: application/pdf
Relation: https://doi.org/10.18452/26663
-
7
Autoren: et al.
Schlagwörter: parameterized computational complexity, exact algorithms, multi-modal data, matching, Hamiltonian path, community detection, 004 Informatik, ddc:004
Dateibeschreibung: application/pdf
Relation: https://doi.org/10.18452/21661
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Journal of Computer and System Sciences. 77:1141-1158
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
9
Autoren: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9783540580942
Schlagwörter: 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)
Dateibeschreibung: application/xml
Zugangs-URL: 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 -
10
Autoren:
Weitere Verfasser:
Quelle: Information Processing Letters. 81:163-168
Schlagwörter: 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
Dateibeschreibung: application/xml; application/pdf
Zugangs-URL: 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 -
11
Autoren: Todd Wareham
Quelle: EAI Endorsed Transactions on Serious Games, Vol 3, Iss 9, Pp 1-8 (2016)
Schlagwörter: swarm robotics, subsumption architecture, parameterized computational complexity, Special aspects of education, LC8-6691, Computer software, QA76.75-76.765
-
12
Autoren:
Quelle: Archive for Mathematical Logic. 40:329-348
Schlagwörter: 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
Dateibeschreibung: application/xml
-
13
Autoren: et al.
Quelle: Archive for Mathematical Logic. 36:321-337
Schlagwörter: Complexity of computation (including implicit computational complexity), Analysis of algorithms and problem complexity, derivations, parameterized computational complexity, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 01 natural sciences, factorizations, hardness, parameterized computations of Turing machines, nondeterministic machine, completeness, \(W\) hierarchy, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics
Dateibeschreibung: application/xml
-
14
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Mathematical Logic Quarterly. 43:179-202
Schlagwörter: Analysis of algorithms and problem complexity, Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI, Turing machines, 0102 computer and information sciences, Models of computation (Turing machines, etc.), parameterized computational problem, 01 natural sciences, Computational complexity, Turing machine, Turing machines and related notions, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Parameterized computational complexity
Dateibeschreibung: application/xml; application/pdf
-
15
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Key words, Parameterized computational complexity, NP-hard problems, W[2]-completeness
Dateibeschreibung: application/pdf
-
16
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Influence Spreading, Spread of Information, Viral Marketing, Algorithms and Complexity, Parameterized Computational Complexity, Fixed-Parameter-Tractability, Data Reduction
Dateibeschreibung: application/pdf
-
17
Autoren:
Weitere Verfasser:
-
18
Autoren:
Weitere Verfasser:
Schlagwörter: férový úkol, výběr cílové množiny, férový výběr cílové množiny, virální marketing, sociální sítě, parametrizovaná výpočetní složitost, fair objective, target set selection, fair target set selection, viral marketing, social networks, parameterized computational complexity
Dateibeschreibung: application/pdf; application/octet-stream
Relation: http://hdl.handle.net/10467/95445
Verfügbarkeit: http://hdl.handle.net/10467/95445
-
19
Autoren: et al.
Full Text Finder 
Nájsť tento článok vo Web of Science