Výsledky vyhledávání - "Exponential-time algorithm"
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: Journal of Computer and System Sciences. 105:87-103
Témata: maximum satisfiability, exponential time algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences, circuit complexity, circuit minimization
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2016/6490/pdf/LIPIcs-MFCS-2016-82.pdf
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=201902225614817720
https://www.sciencedirect.com/science/article/abs/pii/S0022000017302659
https://dblp.uni-trier.de/db/journals/jcss/jcss105.html#SakaiSTT19
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#SakaiSTT16
http://drops.dagstuhl.de/opus/volltexte/2016/6490/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.82 -
2
Autoři:
Přispěvatelé:
Zdroj: Lecture Notes in Computer Science ISBN: 9783540310006
Témata: algorithm, exponential time algorithm, Applied Mathematics, efficient triangulations, 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, graph, 01 natural sciences, Graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Branchwidth, Discrete Mathematics and Combinatorics, exponential algorithms, Exponential time algorithm, branchwidth
Popis souboru: application/pdf
Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-00380511/file/Computing_branchwidth_conf.pdf
https://hal.science/hal-00380511v1/document
https://doi.org/10.1007/11604686_33
https://hal.science/hal-00380511v1
https://hal.archives-ouvertes.fr/hal-00380511
https://dblp.uni-trier.de/db/conf/wg/wg2005.html#FominMT05
https://hal.archives-ouvertes.fr/hal-00380511/document
https://link.springer.com/chapter/10.1007/11604686_33
http://www.ii.uib.no/publikasjoner/texrap/pdf/2005-297.pdf
https://rd.springer.com/chapter/10.1007%2F11604686_33
https://hal.archives-ouvertes.fr/hal-00390623
https://dblp.uni-trier.de/db/journals/dam/dam157.html#FominMT09
https://www.sciencedirect.com/science/article/pii/S0166218X08003405
https://hal.archives-ouvertes.fr/hal-00390623/document
https://doi.org/10.1016/j.dam.2008.08.009
https://www.sciencedirect.com/science/article/abs/pii/S0166218X08003405
https://hal.science/hal-00085562v1 -
3
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 77:173-200
Témata: FOS: Computer and information sciences, Applied Mathematics, polynomial-time algorithm, exponential-time algorithm, Populations and Evolution (q-bio.PE), phylogenetic network, NP-hard, [INFO] Computer Science [cs], Computer Science Applications, supernetwork, FOS: Biological sciences, Computer Science - Data Structures and Algorithms, [INFO]Computer Science [cs], aho algorithm, Data Structures and Algorithms (cs.DS), phylogenetic tree, trinet, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Quantitative Biology - Populations and Evolution, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], Computer Science(all)
Popis souboru: application/pdf
Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs00453-015-0069-8.pdf
http://arxiv.org/abs/1411.6804
https://ueaeprints.uea.ac.uk/id/eprint/54720/
https://paperity.org/p/74099078/reconstructing-phylogenetic-level-1-networks-from-nondense-binet-and-trinet-sets
https://dblp.uni-trier.de/db/journals/corr/corr1411.html#HuberIMSW14
https://repository.tudelft.nl/islandora/object/uuid%3Ae38c8ed4-19e3-4dda-b984-f91f69a6df31
https://repository.tudelft.nl/islandora/object/uuid%3Ae38c8ed4-19e3-4dda-b984-f91f69a6df31/datastream/OBJ/download
https://link.springer.com/article/10.1007/s00453-015-0069-8
https://ueaeprints.uea.ac.uk/id/eprint/54720/
https://hal.science/hal-02154892v1/document
https://doi.org/10.1007/s00453-015-0069-8
https://hal.science/hal-02154892v1
http://resolver.tudelft.nl/uuid:e38c8ed4-19e3-4dda-b984-f91f69a6df31 -
4
Autoři:
Zdroj: Bang-Jensen, J, Saurabh, S & Simonsen, S 2016, ' Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs ', Algorithmica, vol. 76, no. 1, pp. 279-296 . https://doi.org/10.1007/s00453-015-0037-3
AlgorithmicaTémata: Parameterized complexity, Partitioning problem, Spanning tree, Branching, 0102 computer and information sciences, Exponential time algorithm, Fixed parameter tractable, Linear vertex kernel, 01 natural sciences
Přístupová URL adresa: https://portal.findresearcher.sdu.dk/da/publications/parameterized-algorithms-for-non-separating-trees-and-branchings-
http://findresearcher.sdu.dk/portal/da/publications/parametrized-algorithms-for-nonseparating-trees-and-branchings-in-digraphs(87cfc6f5-ec88-4b48-9d5d-06223f646bd8).html
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica76.html#Bang-JensenSS16
https://link.springer.com/article/10.1007/s00453-015-0037-3/fulltext.html
https://doi.org/10.1007/s00453-015-0037-3
https://link.springer.com/article/10.1007/s00453-015-0037-3
https://portal.findresearcher.sdu.dk/da/publications/87cfc6f5-ec88-4b48-9d5d-06223f646bd8 -
5
Autoři:
Přispěvatelé:
Zdroj: Journal of Computer and System Sciences. 78:305-335
Témata: FOS: Computer and information sciences, F.2.2, G.2.2, Convex programming, Discrete Mathematics (cs.DM), Computer Networks and Communications, Applied Mathematics, 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, Constraint satisfaction, Hybrid instances, 01 natural sciences, Measure and conquer, Theoretical Computer Science, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Exponential-time algorithm, Computational Theory and Mathematics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Polynomial space, Satisfiability, Computer Science - Discrete Mathematics
Přístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611973068.67
http://arxiv.org/abs/0906.3527
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00400463
https://dl.acm.org/doi/10.5555/1496770.1496837
https://epubs.siam.org/doi/pdf/10.1137/1.9781611973068.67
https://core.ac.uk/display/82431903
https://dblp.uni-trier.de/db/journals/corr/corr0906.html#abs-0906-3527
http://www.kr.tuwien.ac.at/drm/gaspers/papers/Soda2009.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00400463v1 -
6
Autoři: a další
Přispěvatelé: a další
Témata: exponential time algorithm, circuit complexity, circuit minimization, maximum satisfiability
Popis souboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.82
-
7
Autoři: a další
Přispěvatelé: a další
Témata: subset sum, additive combinatorics, exponential-time algorithm, homo-morphic hashing, littlewood–offord problem
Popis souboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.13
-
8
Autoři: a další
Přispěvatelé: a další
Témata: subset sum, additive combinatorics, exponential-time algorithm, homomorphic hashing, Littlewood--Offord problem
Popis souboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.48
-
9
Autoři: a další
Přispěvatelé: a další
Témata: FOS: Computer and information sciences, Additive combinatorics, Discrete Mathematics (cs.DM), Computer Science - Information Theory, exponential-time algorithm, cs.DM, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, cs.IT, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), math.IT, ta113, cs.CC, Information Theory (cs.IT), littlewood–offord problem, Subset Sum, Computer Science - Computational Complexity, cs.DS, Exponential-time algorithm, additive combinatorics, Littlewood-offord problem, subset sum, ddc:004, Homomorphic hashing, homo-morphic hashing, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/1508.06019
http://juuli.fi/Record/0274780416
https://doi.org/10.4230/LIPIcs.STACS.2016.13
http://10.10.70.176:8080/experts/en/publications/77432794-5622-49e3-97ca-e8e958724534
https://doi.org/10.48550/arXiv.1508.06019
http://ui.adsabs.harvard.edu/abs/2015arXiv150806019A/abstract
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F4d5c27f6-f042-45b0-966d-b98a99c4c7be
https://drops.dagstuhl.de/opus/volltexte/2016/5714/
https://aaltodoc.aalto.fi:443/handle/123456789/25206
https://arxiv.org/abs/1508.06019
https://research.tue.nl/en/publications/dense-subset-sum-may-be-the-hardest
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.13
https://dspace.library.uu.nl/handle/1874/424655
https://aaltodoc.aalto.fi/handle/123456789/25206 -
10
Autoři:
Zdroj: Theoretical Computer Science. 320:373-394
Témata: 3-satisfiability, Counting, Exact, Exact solution, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, XSAT, 01 natural sciences, Theoretical Computer Science, Algorithm, Computational complexity, Exponential-time algorithm, 0202 electrical engineering, electronic engineering, information engineering, Exact 3-satisfiability, Complexity classes (hierarchies, relations among complexity classes, etc.), Analysis of algorithms, SAT, Exact satisfiability, 3-Satisfiability, Satisfiability, X3SAT, Counting models, Counting problem, Computer Science(all)
Popis souboru: application/xml
Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/tcs/tcs320.html#DahllofJB04
http://www.diva-portal.org/smash/record.jsf?pid=diva2:266609
https://core.ac.uk/display/82736750
https://dl.acm.org/doi/10.1016/j.tcs.2004.02.035
https://www.sciencedirect.com/science/article/pii/S0304397504001343
http://swepub.kb.se/bib/swepub:oai:DiVA.org:liu-45713?vw=full -
11
Autoři:
Zdroj: Byskov, J M, Madsen, B A & Skjernaa, B 2003, 'New Algorithms for Exact Satisfiability', B R I C S Report Series, no. RS-03-30.
Madsen, B A, Byskov, J M & Skjernaa, B 2005, 'New Algorithms for Exact Satisfiability', Theoretical Computer Science, vol. 332, no. 1-3, pp. 515-541.Témata: Exact 3-Satisfiability, Exponential-time algorithm, Exact solution, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Nonnumerical algorithms, 01 natural sciences, Exact Satisfiability, Branch-and-reduce algorithm, Theoretical Computer Science, Computer Science(all)
Popis souboru: application/xml
Přístupová URL adresa: https://tidsskrift.dk/brics/article/download/21798/19229
https://zbmath.org/2153200
https://doi.org/10.1016/j.tcs.2004.12.023
https://core.ac.uk/display/82688371
https://www.sciencedirect.com/science/article/pii/S0304397504008187
https://dblp.uni-trier.de/db/journals/tcs/tcs332.html#ByskovMS05
https://dl.acm.org/doi/10.1016/j.tcs.2004.12.023
https://tidsskrift.dk/brics/article/download/21798/19229
https://core.ac.uk/display/24651320
https://tidsskrift.dk/index.php/brics/article/view/21798/0
https://pure.au.dk/portal/en/publications/9bf31d80-969f-11dc-bee9-02004c4f4f50
https://pure.au.dk/portal/en/publications/40f4c490-b00c-11da-bee9-02004c4f4f50 -
12
Autoři:
Zdroj: Electronic Notes in Theoretical Computer Science. 74:39-50
Témata: isometrically isomorphic, exponential time algorithm, supP(n)-complexity space, biBanach, 0101 mathematics, asymmetric norms, semialgebra, 01 natural sciences, Theoretical Computer Science, Computer Science(all)
-
13
Autoři:
Zdroj: International Journal of Game Theory. 25:73-92
Témata: Noncooperative games, exponential-time algorithm, 0202 electrical engineering, electronic engineering, information engineering, two-person game in extensive form, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, equilibria, 01 natural sciences, 2-person games
Popis souboru: application/xml
-
14
Autoři:
Přispěvatelé:
Zdroj: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. :408-417
Témata: Science, Analysis of algorithms and problem complexity, semi-algebraic subsets, Symbolic computation and algebraic computation, 01 natural sciences, sums of Betti numbers, Effectivity, complexity and computational aspects of algebraic geometry, Legacy, single exponential time algorithm, real algebraic geometry, Euler characteristics, 0101 mathematics, Semialgebraic sets and related spaces, Mathematics
Popis souboru: application/xml; 120542 bytes; 3115 bytes; application/pdf; text/plain
Přístupová URL adresa: http://deepblue.lib.umich.edu/bitstream/2027.42/42421/1/454-22-1-1_22n1p1.pdf
https://link.springer.com/content/pdf/10.1007%2FPL00009443.pdf
https://deepblue.lib.umich.edu/bitstream/handle/2027.42/42421/454-22-1-1_22n1p1.pdf;sequence=1
https://deepblue.lib.umich.edu/bitstream/2027.42/42421/1/454-22-1-1_22n1p1.pdf
https://core.ac.uk/display/21536377
https://dl.acm.org/doi/10.1145/237814.237988
http://deepblue.lib.umich.edu/bitstream/2027.42/42421/1/454-22-1-1_22n1p1.pdf
https://dblp.uni-trier.de/db/conf/stoc/stoc1996.html#Basu96 -
15
Autoři: a další
Přispěvatelé: a další
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.372.8226; http://www.cse.psu.edu/~kasivisw/bwapprox111120.pdf
-
16
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory Additional Key Words and Phrases, Exponential-time algorithm, exact algorithm, constraint satisfaction, discrete optimization, partition function, generating function
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.7666; http://people.maths.ox.ac.uk/~scott/Papers/counting.pdf
-
17
Autoři: a další
Přispěvatelé: a další
Témata: Conditional simple temporal networks, Dynamic-consistency, is an element of-dynamic-consistency, Instantaneous reaction-time, Hyper temporal networks, Singly-exponential time algorithm
Popis souboru: ELETTRONICO
Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000528260400003; volume:113; issue:100542; firstpage:1; lastpage:11; numberofpages:11; journal:THE JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING; http://hdl.handle.net/11562/1031503
-
18
Autoři: a další
Přispěvatelé: a další
Popis souboru: ELETTRONICO
Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000527045500007; volume:39; issue:3; firstpage:764; lastpage:775; numberofpages:12; journal:JOURNAL OF COMBINATORIAL OPTIMIZATION; https://hdl.handle.net/11583/2948112
-
19
Autoři: 脊戸, 和寿
Relation: http://hdl.handle.net/10928/606; AA1203510X; 成蹊大学理工学研究報告 = The journal of the Faculty of Science and Technology, Seikei University; 51; 19; 21
-
20
Autoři: a další
Témata: phylogenetic tree, phylogenetic network, polynomial-time algorithm, exponential-time algorithm, NP-hard, supernetwork, trinet, aho algorithm
Relation: Algorithmica, 2015--0178-4617
Full Text Finder
Nájsť tento článok vo Web of Science