Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Exponential time")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 111

  • Page / 5
Export

Selection :

  • and

AN ISOMORPHISM BETWEEN SUBEXPONENTIAL AND PARAMETERIZED COMPLEXITY THEORYYIJIA CHEN; GROHE, Martin.SIAM journal on computing (Print). 2008, Vol 37, Num 4, pp 1228-1258, issn 0097-5397, 31 p.Article

Exact Exponential AlgorithmsFOMIN, Fedor V; KASKI, Petteri.Communications of the ACM. 2013, Vol 56, Num 3, pp 80-88, issn 0001-0782, 9 p.Article

New algorithms for Exact SatisfiabilityBYSKOV, Jesper Makholm; MADSEN, Bolette Ammitzbøll; SKJERNAA, Bjarke et al.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 515-541, issn 0304-3975, 27 p.Article

Counting models for 2SAT and 3SAT formulaeDAHLLÖF, Vilhelm; JONSSON, Peter; WAHLSTRÖM, Magnus et al.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 265-291, issn 0304-3975, 27 p.Article

Symbolic model checking for μ-calculus requires exponential timeRABINOVICH, A.Theoretical computer science. 2000, Vol 243, Num 1-2, pp 467-475, issn 0304-3975Article

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2nCYGAN, Marek; PILIPCZUK, Marcin; PILIPCZUK, Michał et al.Algorithmica. 2014, Vol 70, Num 2, pp 195-207, issn 0178-4617, 13 p.Conference Paper

Exact and Parameterized Algorithms for MAX INTERNAL SPANNING TREEBINKELE-RAIBLE, Daniel; FERNAU, Henning; GASPERS, Serge et al.Algorithmica. 2013, Vol 65, Num 1, pp 95-128, issn 0178-4617, 34 p.Article

Mining Frequent Item Sets Efficiently by Using Compression TechniquesMIMAROGLU, Selim; CUBUKCU, Cagri; AKSEHIRLI, Emin et al.Data mining. International conferenceWorldComp'2011. 2011, pp 308-312, isbn 1-60132-168-6, 5 p.Conference Paper

Generalized integrating factor methods for stiff PDEsKROGSTAD, S.Journal of computational physics (Print). 2005, Vol 203, Num 1, pp 72-88, issn 0021-9991, 17 p.Article

Complexity results for the gap inequalities for the max-cut problemGALLI, Laura; KAPARIS, Konstantinos; LETCHFORD, Adam N et al.Operations research letters. 2012, Vol 40, Num 3, pp 149-152, issn 0167-6377, 4 p.Article

High-order predictor-corrector of exponential fitting for the N-body problemsCHEN TANG; WENPING WANG; HAIQING YAN et al.Journal of computational physics (Print). 2006, Vol 214, Num 2, pp 505-520, issn 0021-9991, 16 p.Article

On Cutwidth Parameterized by Vertex CoverCYGAN, Marek; LOKSHTANOV, Daniel; PILIPCZUK, Marcin et al.Algorithmica. 2014, Vol 68, Num 4, pp 940-953, issn 0178-4617, 14 p.Article

Toward the Minimal Universal Petri NetZAITSEV, Dmitry A.IEEE transactions on systems, man, and cybernetics. Systems (Print). 2014, Vol 44, Num 1, pp 47-58, issn 2168-2216, 12 p.Article

On the Power Allocation Problem in the Gaussian Interference Channel with Proportional Rate ConstraintsILLANKO, Kandasamy; ANPALAGAN, Alagan; HOSSAIN, Ekram et al.IEEE transactions on wireless communications. 2014, Vol 13, Num 2, pp 1101-1115, issn 1536-1276, 15 p.Article

Polynomial-Time Algorithms for Energy Games with Special Weight StructuresCHATTERJEE, Krishnendu; HENZINGER, Monika; KRINNINGER, Sebastian et al.Algorithmica. 2014, Vol 70, Num 3, pp 457-492, issn 0178-4617, 36 p.Article

The Parameterized Complexity of Local Search for TSP, More RefinedJIONG GUO; HARTUNG, Sepp; NIEDERMEIER, Rolf et al.Algorithmica. 2013, Vol 67, Num 1, pp 89-110, issn 0178-4617, 22 p.Conference Paper

Bifurcation analysis and control in exponential RED algorithmWENYING XU; JINDE CAO; MIN XIAO et al.Neurocomputing (Amsterdam). 2014, Vol 129, pp 232-245, issn 0925-2312, 14 p.Article

Improved Approximation Algorithms for the Average-Case Tree Searching ProblemCICALESE, Ferdinando; JACOBS, Tobias; LABER, Eduardo et al.Algorithmica. 2014, Vol 68, Num 4, pp 1045-1074, issn 0178-4617, 30 p.Article

Exponential stability of FCNNs with time-varying leakage delays and reaction-diffusion termsKE JING.Neurocomputing (Amsterdam). 2014, Vol 145, pp 363-368, issn 0925-2312, 6 p.Article

On Boolean control networks with maximal topological entropyLASCHOV, Dmitriy; MARGALIOT, Michael.Automatica (Oxford). 2014, Vol 50, Num 11, pp 2924-2928, issn 0005-1098, 5 p.Article

On the complexity of planning for agent teams and its implications for single agent planningBRAFMAN, Ronen I; DOMSHLAK, Carmel.Artificial intelligence (General ed.). 2013, Vol 198, pp 52-71, issn 0004-3702, 20 p.Article

Rule-based expert systems to support step-by-step guidance in algebraic problem solving: The case of the tutor PAT2MathJAQUES, Patricia A; SEFFRIN, Henrique; RUBI, Geiseane et al.Expert systems with applications. 2013, Vol 40, Num 14, pp 5456-5465, issn 0957-4174, 10 p.Article

A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems : Theory of Randomized Search HeuristicsSUDHOLT, Dirk; THYSSEN, Christian.Algorithmica. 2012, Vol 64, Num 4, pp 643-672, issn 0178-4617, 30 p.Article

Enumerating Minimal Subset Feedback Vertex SetsFOMIN, Fedor V; HEGGERNES, Pinar; KRATSCH, Dieter et al.Algorithmica. 2014, Vol 69, Num 1, pp 216-231, issn 0178-4617, 16 p.Article

Inclusion/Exclusion Meets Measure and ConquerNEDERLOF, Jesper; VAN ROOIJ, Johan M. M; VAN DIJK, Thomas C et al.Algorithmica. 2014, Vol 69, Num 3, pp 685-740, issn 0178-4617, 56 p.Article

  • Page / 5