Search Results - Fixed parameter complexity

The complexity of quantum circuit mapping with fixed parameters

Authors: Pengcheng Zhu Shenggen Zheng Lihua Wei et al.

Source: Quantum Information Processing. 21

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering, FOS: Physical sciences, 02 engineering and technology, Computational Complexity (cs.CC), Quantum Physics (quant-ph)

Access URL: http://arxiv.org/abs/2207.08438

The Complexity of Quantum Circuit Mapping with Fixed Parameters

Authors: Zhu, Pengcheng Zheng, Shenggen Wei, Lihua et al.

Index Terms: Quantum Physics, Computer Science - Computational Complexity, text

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

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning: Fixed-parameter complexity in AI and nonmonotonic reasoning

Authors: Gottlob, Georg Scarcello, Francesco Sideri, Martha

Source: Lecture Notes in Computer Science ISBN: 9783540667490

Subject Terms: stable models, Stable models, constraint satisfaction, 0102 computer and information sciences, Constraint satisfaction, Logic programming, Reasoning under uncertainty in the context of artificial intelligence, 01 natural sciences, nonmonotonic reasoning, prime implicants, Conjunctive queries, Parameterized complexity, logic programming, Prime implicants, Circumscription, Artificial Intelligence, Fixed-parameter tractability, Nonmonotonic reasoning, mixed-parameter tractability, circumscription, conjunctive queries, Complexity, Theoretical Computer Science, Computer Science (all), parameterized complexity

File Description: application/xml

Access URL: https://rd.springer.com/chapter/10.1007/3-540-46767-X_1
https://iris.unical.it/handle/20.500.11770/272850
https://dblp.uni-trier.de/db/conf/lpnmr/lpnmr99.html#GottlobSS99
https://link.springer.com/chapter/10.1007/3-540-46767-X_1
https://www.cs.ox.ac.uk/publications/publication214-abstract.html
https://www.sciencedirect.com/science/article/abs/pii/S0004370202001820
https://link.springer.com/chapter/10.1007%2F3-540-46767-X_1
https://www.sciencedirect.com/science/article/pii/S0004370202001820
https://dblp.uni-trier.de/db/journals/ai/ai138.html#GottlobSS02
https://ora.ox.ac.uk/objects/uuid:d9c37c7a-718c-438e-8d3e-1773b8335aea
http://springerlink.com/content/0302-9743/copyright/2005/
https://hdl.handle.net/20.500.11770/272850
https://doi.org/10.1007/3-540-46767-X_1

Fixed-Parameter Complexity of λ-Labelings

Authors: Ton Kloks Jirí Fiala Jan Kratochvíl

Source: Lecture Notes in Computer Science ISBN: 9783540667315

Subject Terms: Applied Mathematics, Graph cover, Discrete Mathematics and Combinatorics, Channel assignment, 0102 computer and information sciences, Fixed-parameter complexity, 01 natural sciences, Graph labeling

Access URL: https://www.sciencedirect.com/science/article/pii/S0166218X00003875
https://link.springer.com/chapter/10.1007%2F3-540-46784-X_33
https://rd.springer.com/chapter/10.1007/3-540-46784-X_33
https://dblp.uni-trier.de/db/journals/dam/dam113.html#FialaKK01
https://link.springer.com/10.1007%2F3-540-46784-X_33

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Authors: Johann A. Makowsky Udi Rotics Bruno Courcelle

Source: Discrete Applied Mathematics. 108:23-52

Subject Terms: combinatorial enumeration, Applied Mathematics, monadic second-order logic, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Enumeration in graph theory, Fixed parameter complexity, 01 natural sciences, Graph algorithms (graph-theoretic aspects), treewidth, Discrete Mathematics and Combinatorics, Combinatorial enumeration, fixed parameter complexity, Higher-order logic, type theory

File Description: application/xml

Access URL: https://zbmath.org/1584464
https://doi.org/10.1016/s0166-218x(00)00221-3

Fixed-Parameter Complexity and Approximability of Norm Maximization

Authors: Christian Knauer Daniel Werner Stefan König

Source: Discrete & Computational Geometry. 53:276-295

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Complexity, Mathematics - Metric Geometry, Optimization and Control (math.OC), FOS: Mathematics, Computer Science - Computational Geometry, Metric Geometry (math.MG), 0102 computer and information sciences, Computational Complexity (cs.CC), 0101 mathematics, Mathematics - Optimization and Control, 01 natural sciences

Access URL: http://arxiv.org/pdf/1307.6414.pdf
http://arxiv.org/abs/1307.6414
https://rd.springer.com/article/10.1007/s00454-015-9667-0
http://www-m9.ma.tum.de/foswiki/pub/Allgemeines/StefanKoenig/normmax.pdf
https://link.springer.com/article/10.1007/s00454-015-9667-0
https://doi.org/10.1007/s00454-015-9667-0
https://link.springer.com/article/10.1007/s00454-015-9667-0/fulltext.html
https://dblp.uni-trier.de/db/journals/corr/corr1307.html#KnauerKW13

On Fixed-Parameter Complexity of Infinite Games

Authors: Björklund, Henrik Sandberg, Sven Vorobyov, Sergei

Source: Technical report / Department of Information Technology, Uppsala University.

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-49004
https://uu.diva-portal.org/smash/get/diva2:76911/FULLTEXT01.ps

The Computational Complexity of Factored Graphs

Authors: Huang, Boyang

Subject Terms: Computer science, Fine-grained complexity, Fixed-parameter tractability, Graph algorithms, Parameterized complexity

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/43k0b3n0
https://escholarship.org/content/qt43k0b3n0/qt43k0b3n0.pdf

Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity

Authors: Chuan-Min Lee

Source: Axioms, Vol 13, Iss 6, p 382 (2024)

Subject Terms: signed clique transversal, minus clique transversal, b-fold clique transversal, {b}-clique transversal, fixed parameter tractable, para-NP-complete, Mathematics, QA1-939

File Description: electronic resource

Relation: https://www.mdpi.com/2075-1680/13/6/382; https://doaj.org/toc/2075-1680

Access URL: https://doaj.org/article/7e035e0d37dd481ca9179fc0cd8c7b1b

Fixed-Parameter Complexity of Minimum Profile Problems

Authors: Stefan Szeider Anders Yeo Gregory Gutin

Source: Lecture Notes in Computer Science ISBN: 9783540390985

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/cs/0604095

Fixed-Parameter Complexity of Semantics for Logic Programs

Authors: Miroslaw Truszczynski Zbigniew Lonc

Source: Lecture Notes in Computer Science ISBN: 9783540429357

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, I.2.4, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, D.1.6, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, F.1.3, 01 natural sciences, Logic in Computer Science (cs.LO)

Access URL: http://arxiv.org/abs/cs/0107027
https://link.springer.com/chapter/10.1007/3-540-45635-X_21
https://dblp.uni-trier.de/db/conf/iclp/iclp2001.html#LoncT01
https://rd.springer.com/chapter/10.1007/3-540-45635-X_21
https://dblp.uni-trier.de/db/journals/tocl/tocl4.html#LoncT03
https://dl.acm.org/doi/10.1145/601775.601779

The complexity of fixed-parameter problems: guest column

Authors: Jonathan F. Buss Tarique Islam

Source: ACM SIGACT News. 39:33-46

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

Access URL: https://dlnext.acm.org/doi/10.1145/1360443.1360454
https://dl.acm.org/doi/10.1145/1360443.1360454
https://dblp.uni-trier.de/db/journals/sigact/sigact39.html#BussI08

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems

Authors: Dušan Knop Martin Koutecký Jiří Fiala et al.

Source: Lecture Notes in Computer Science ISBN: 9783319426334

Subject Terms: 4. Education, G.2.2, 15. Life on land, 16. Peace & justice, 05C78, 7. Clean energy, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/pdf/1507.00640
http://arxiv.org/abs/1507.00640
https://link.springer.com/chapter/10.1007/978-3-319-42634-1_6
https://ui.adsabs.harvard.edu/abs/2015arXiv150700640F/abstract
https://rd.springer.com/chapter/10.1007/978-3-319-42634-1_6
https://link.springer.com/chapter/10.1007/978-3-319-42634-1_6/fulltext.html

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis

Authors: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi et al.

Subject Terms: Applied Mathematics, Mathematical Sciences, Fixed-parameter algorithms and complexity, Hardness of approximations, PCP theorems

Access URL: https://escholarship.org/uc/item/1j64r6k1

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems

Authors: Fiala, Jiří Gavenčiak, Tomáš Knop, Dušan et al.

Index Terms: Computer Science - Discrete Mathematics, 05C78, G.2.2, text

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

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Authors: Szeider, S.

Source: Lecture Notes in Computer Science ISBN: 9783540405344
Journal of computer and system sciences, 2004, Vol.69(4), pp.656-674 [Peer Reviewed Journal]

Subject Terms: Expansion, Minimal unsatisfiability, Tree-width, Computer Networks and Communications, Analysis of algorithms and problem complexity, Applied Mathematics, \(D^P\)-complete problem, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Theoretical Computer Science, Computational Theory and Mathematics, SAT problem, Bipartite matching, Graph theory (including graph drawing) in computer science, DP-complete problem, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Fixed-parameter complexity

File Description: application/xml; application/pdf

Access URL: http://dro.dur.ac.uk/610/1/610.pdf
https://zbmath.org/2137325
https://doi.org/10.1016/j.jcss.2004.04.009
https://www.sciencedirect.com/science/article/pii/S0022000004000613
http://dro.dur.ac.uk/610/
https://www.ac.tuwien.ac.at/files/pub/szeider-jcss-2004.pdf
https://doi.org/10.1016/j.jcss.2004.04.009
https://rd.springer.com/chapter/10.1007/3-540-45071-8_55
https://dro.dur.ac.uk/610/
https://dblp.uni-trier.de/db/conf/cocoon/cocoon2003.html#Szeider03
https://doi.org/10.1007/3-540-45071-8_55
https://core.ac.uk/display/102555294
https://link.springer.com/content/pdf/10.1007/3-540-45071-8_55.pdf
https://link.springer.com/chapter/10.1007%2F3-540-45071-8_55

Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments

Authors: Sheng-Ying Hsiao

Source: Lecture Notes in Computer Science ISBN: 9783642255908

Access URL: https://rd.springer.com/chapter/10.1007%2F978-3-642-25591-5_36
https://dblp.uni-trier.de/db/conf/isaac/isaac2011.html#Hsiao11
http://dblp.uni-trier.de/db/conf/isaac/isaac2011.html#Hsiao11
https://link.springer.com/chapter/10.1007/978-3-642-25591-5_36

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems

Authors: Fiala, Ji���� Gaven��iak, Tom���� Knop, Du��an et al.

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2.2, 05C78

Fixed Parameter Complexity and Approximability of Norm Maximization

Authors: Knauer, Christian König, Stefan Werner, Daniel

Index Terms: Computer Science - Computational Complexity, Computer Science - Computational Geometry, Mathematics - Metric Geometry, Mathematics - Optimization and Control, text

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

A Brief Survey of Fixed-Parameter Parallelism

Authors: Faisal N. Abu-Khzam Karam Al Kontar

Source: Algorithms, Vol 13, Iss 8, p 197 (2020)

Subject Terms: fixed-parameter parallelism, parameterized complexity, parallel computing, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: https://www.mdpi.com/1999-4893/13/8/197; https://doaj.org/toc/1999-4893

Access URL: https://doaj.org/article/9e5b0443cce04be19e0c304ce36894e7