Výsledky vyhledávání - parameterized computational complexity
-
1
Autoři: Huang, Boyang
Témata: Computer science, Fine-grained complexity, Fixed-parameter tractability, Graph algorithms, Parameterized complexity
Popis souboru: application/pdf
-
2
Autoři:
Zdroj: Procedia Computer Science. 2025, Vol. 273, p509-516. 8p.
-
3
Autoři: a další
Témata: Machine Learning, FOS: Computer and information sciences, Computational Complexity, Discrete Mathematics (cs.DM), Discrete Mathematics, Neural and Evolutionary Computing, Neural and Evolutionary Computing (cs.NE), Computational Complexity (cs.CC), Machine Learning (cs.LG)
Přístupová URL adresa: http://arxiv.org/abs/2509.22849
-
4
Autoři: 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)
-
5
Autoři:
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 -
6
Autoři: 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 -
7
Autoři:
Zdroj: Discrete Applied Mathematics. 248:56-67
Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, G.1.6, G.2.2, F.1.3, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences
Přístupová URL adresa: http://arxiv.org/pdf/1511.08841
http://arxiv.org/abs/1511.08841
https://www.sciencedirect.com/science/article/pii/S0166218X17302329
https://arxiv.org/abs/1511.08841
https://www.muni.cz/vyzkum/publikace/1392989
https://is.muni.cz/publication/1392989/cs/Parameterized -Extension-Complexity -of-Independent-Set-and-Related-Problems/Gajarsky-Hlineny-Raj-Tiwary
https://doi.org/10.1016/j.dam.2017.04.042
https://dblp.uni-trier.de/db/journals/corr/corr1511.html#GajarskyHT15 -
8
Autoři: 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
-
9
Autoři: 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
-
10
Autoři: a další
Zdroj: Bioinformatics. 11:49-57
Témata: Protein Folding, Biometry, Models, Statistical, Evaluation Studies as Topic, 0202 electrical engineering, electronic engineering, information engineering, Nucleic Acid Conformation, Proteins, DNA, 0102 computer and information sciences, 02 engineering and technology, Sequence Alignment, 01 natural sciences, Algorithms
Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/7796275
https://research-portal.uu.nl/en/publications/b70ebf8c-5ed3-4cdc-a690-35bfe6d2ed0f
https://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics11.html#BodlaenderDFHW95
https://academic.oup.com/bioinformatics/article/11/1/49/212335
https://www.ncbi.nlm.nih.gov/pubmed/7796275
https://core.ac.uk/display/24347377
https://europepmc.org/article/MED/7796275 -
11
Autoři: a další
Přispěvatelé: a další
Zdroj: Mathematical Logic Quarterly. 43:179-202
Témata: 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
Popis souboru: application/xml; application/pdf
-
12
Autoři:
Zdroj: IEEE Access, Vol 10, Pp 104436-104448 (2022)
Témata: Fast fourier transform, computational complexity, throughput, spectro-computational analysis, vector OFDM, parameterized complexity, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Popis souboru: electronic resource
Přístupová URL adresa: https://doaj.org/article/0be9d534013b4972a2a64bf9934ee42e
-
13
Autoři: Remie Janssen
Zdroj: Theory and Applications of Graphs, Vol 7 (2020)
Témata: burning number, w[2], np-hard, parameterized complexity, graph algorithms, directed graph, digraph, Mathematics, QA1-939
Popis souboru: electronic resource
Relation: https://digitalcommons.georgiasouthern.edu/tag/vol7/iss1/8; https://doaj.org/toc/2470-9859
Přístupová URL adresa: https://doaj.org/article/d7c17a6676f2423c9d96a4fc1c8e3375
-
14
-
15
Autoři:
Zdroj: 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century. 1:880-885
Témata: 0202 electrical engineering, electronic engineering, information engineering, Algorithms. Computational complexity. Parameter estimation. Polynomials. Position control. Problem solving. Robotics. Robots. Theorem proving, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Popis souboru: application/pdf
-
16
Autoři: 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 -
17
Autoři: a další
Zdroj: Archive for Mathematical Logic. 36:321-337
Témata: 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
Popis souboru: application/xml
-
18
Autoři: 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
-
19
Autoři: a další
Zdroj: Algorithmica. 2021, Vol. 83 Issue 1, p1-44. 44p.
-
20
Autoři:
Zdroj: Computer Science Review. Nov2025, Vol. 58, pN.PAG-N.PAG. 1p.
Full Text Finder
Nájsť tento článok vo Web of Science