The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase polynomial time algorithm (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1971-1981 (17) 1982-1985 (15) 1986-1988 (18) 1989 (20) 1990-1991 (29) 1992 (25) 1993 (28) 1994 (24) 1995 (28) 1996 (34) 1997 (33) 1998 (41) 1999 (48) 2000 (34) 2001 (56) 2002 (75) 2003 (82) 2004 (113) 2005 (119) 2006 (117) 2007 (131) 2008 (140) 2009 (117) 2010 (33) 2011 (15) 2012-2013 (37) 2014 (21) 2015 (29) 2016 (19) 2017 (20) 2018 (16) 2019 (6)
Publication types (Num. hits)
article(490) incollection(4) inproceedings(1046)
Venues (Conferences, Journals, ...)
CoRR(61) FOCS(60) ISAAC(54) STOC(49) SODA(43) Algorithmica(36) ICALP(36) WG(33) ESA(30) IEEE Trans. on CAD of Integrat...(30) J. ACM(26) STACS(24) IPCO(18) MFCS(18) CPM(17) IEEE Trans. Computers(17) More (+10 of total 411)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1438 occurrences of 848 keywords

Results
Found 1540 publication records. Showing 1540 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
40Luc Longpré, Osamu Watanabe 0001 On Symmetry of Information and Polynomial Time Invertibility. Search on Bibsonomy ISAAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
39Masayuki Noro, Kazuhiro Yokoyama Yet another practical implementation of polynomial factorization over finite fields. Search on Bibsonomy ISSAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
38Tadayoshi Horita, Itsuo Takanami A Polynomial Time Algorithm for Reconfiguring the 1 1/2 Track-Switch Model with PE and Bus faults. Search on Bibsonomy ISPAN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF mesh arrays, the 1frac{1}{2} track-switch model, fault-tolerance, polynomial time algorithm, wafer scale integration
36Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar Linkless and flat embeddings in 3-space and the unknot problem. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2010 DBLP  DOI  BibTeX  RDF flat embedding, linkless embedding, unknot, knot
36Lincong Wang, Ramgopal R. Mettu, Bruce Randall Donald An Algebraic Geometry Approach to Protein Structure Determination from NMR Data. Search on Bibsonomy CSB The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Grigory Kogan Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF fields of characteristic 3, computational complexity, complexity, polynomial time algorithm, polynomial-time algorithm, matrix, permanents
34Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF polynomial-sized encoding, membership problem complexity, 2-generated commutative semigroups, rational matrices, deterministic polynomial-time algorithm, ABC problem, 2-generated abelian linear groups, polynomial time algorithm, algebraic number field
32Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko Container Problem in Burnt Pancake Graphs. Search on Bibsonomy ISPA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF burnt pancake graphs, container problem, internally disjoint paths, polynomial time algorithm
31Shashidhar Thakur, D. F. Wong Simultaneous area and delay minimum K-LUT mapping for K-exact networks. Search on Bibsonomy ICCD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF area/delay minimum K-LUT mapping, K-exact networks, technology mapping problem, lookup table FPGAs, area minimization problem, K-bounded networks, delay minimization problem, flow-map algorithm, field programmable gate arrays, computational complexity, complexity, NP-complete, logic design, polynomial time algorithm, programmable logic arrays, table lookup, minimisation of switching nets
30Helmut Seidl, Andrea Flexeder, Michael Petter Analysing All Polynomial Equations in . Search on Bibsonomy SAS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Zohar Shay Karnin, Amir Shpilka Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF PIT, depth-3, arithmetic circuit, deterministic, polynomial identity testing
29Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF # P-completeness, NP-completeness, polynomial time algorithm, enumeration, independent set, Chordal graph, counting
29Arfst Nickelsen, Birgit Schelm Average-Case Computations - Comparing AvgP, HP, and Nearly-P. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Leonid Khachiyan, Lorant Porkolab Computing Integral Points in Convex Semi-algebraic Sets. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF convex semi-algebraic sets, polynomial inequalities, linear integer programming, semidefinite integer programming, integer programming, polynomial-time algorithm, polynomial-time solvability
28Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF noisy linear threshold function learning, ellipsoid algorithm, separation parameter, input description length, weak hypothesis finding, random classification noise, data outlier removal, learning (artificial intelligence), linear program, polynomial-time algorithm, greedy algorithms, noise tolerance, perceptron algorithm, PAC model
28Yoram Hirshfeld, Mark Jerrum, Faron Moller A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF normed context-free processes, language equivalence, polynomial-time algorithm, decidability, equivalence, context-free grammars, bisimilarity
28Alexander I. Barvinok A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF d-dimensional Euclidean space, integral points counting, polynomial time algorithm, polyhedra
28Richa Agarwala, David Fernández-Baca A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF perfect phylogeny problem, character states, NP-complete, polynomial-time algorithm
28Sam M. Kim, Robert McNaughton, Robert McCloskey A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1991 DBLP  DOI  BibTeX  RDF local testability, locally testable language, nonnegative integer, prefix, suffix, computational complexity, polynomial time algorithm, formal languages, finite automata, word, deterministic finite automata, deterministic automata, substrings
28Ali Dasdan A strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations. Search on Bibsonomy CODES The full citation details ... 2002 DBLP  DOI  BibTeX  RDF scheduling, high-level synthesis, constraint satisfaction, timing constraints, behavioral synthesis, rate analysis
28Supratik Chakraborty, David L. Dill More Accurate Polynomial-Time Min-Max Timing Simulation. Search on Bibsonomy ASYNC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Uncertain component delays, min-max timing simulation, thirteen-valued signal algebra, polynomial-time algorithm
26Serafino Cicerone, Daniele Frigioni, Paolino Di Felice Decomposing Spatial Databases and Applications. Search on Bibsonomy DEXA Workshops The full citation details ... 2000 DBLP  DOI  BibTeX  RDF spatial database decomposition, boundary decomposition, polynomial time algorithm, visual databases, topological invariants
26Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai Computing Cartan subalgebras of Lie algebras. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Cartan subalgebra, Polynomial time algorithm, Symbolic computation, Lie algebra
26Arun Balakrishnan, Srimat T. Chakradhar Retiming with logic duplication transformation: theory and an application to partial scan. Search on Bibsonomy VLSI Design The full citation details ... 1996 DBLP  DOI  BibTeX  RDF logic duplication transformation, partial scan application, RLD configurations, RLD transformation, testability metrics, scan flip-flops, sequential circuit design, linear programming, timing, integer programming, logic design, sequential circuits, logic CAD, polynomial time algorithm, integer linear program, flip-flops, retiming, integrated circuit design, circuit CAD, integrated logic circuits, objective function
26Vadim V. Lozin, Martin Milanic A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF polynomial-time algorithm, independent set
26Shao Chin Sung, Milan Vlach Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. Search on Bibsonomy J. Scheduling The full citation details ... 2005 DBLP  DOI  BibTeX  RDF just-in-time jobs, unrelated parallel machines, NP-hardness, polynomial time algorithm
26Marie-Christine Costa, Fethi Jarray, Christophe Picouleau Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. Search on Bibsonomy ICTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF alternate periodicity, polynomial time algorithm, discrete tomography, binary matrix
26Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger More about Subcolorings. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF subcoloring, special graph classes, computational complexity, graph coloring, polynomial time algorithm
26Tomas Sander, Mohammad Amin Shokrollahi Deciding Properties of Polynomials Without Factoring. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF factoring polynomials, polynomial time algorithm, number theory, number theory, Monte Carlo algorithms, algebraic number fields, algebraic equations
24Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg Nash equilibria in graphical games on trees revisited. Search on Bibsonomy EC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF PPAD-completeness, nash equilibrium, graphical games
24Dániel Marx Approximating fractional hypertree width. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
24Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). Search on Bibsonomy COLT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
24Adam R. Klivans, Alexander A. Sherstov Cryptographic Hardness for Learning Intersections of Halfspaces. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
24Adam R. Klivans, Amir Shpilka Learning Arithmetic Circuits via Partial Derivatives. Search on Bibsonomy COLT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF learning with queries, PAC learning
24Naoki Sawada, Keiichi Kaneko, Shietung Peng Pairwise Disjoint Paths in Pancake Graphs. Search on Bibsonomy PDCAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF interconnection networks, polynomial time algorithm, disjoint paths
23Miki Hermann, Phokion G. Kolaitis Unification Algorithms Cannot be Combined in Polynomial Time. Search on Bibsonomy CADE The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
23Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca Independent Sets of Maximum Weight in Apple-Free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
23Joseph Naor, Leonid Zosin A 2-Approximation Algorithm for the Directed Multiway Cut Problem. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF directed multiway cut problem, 2-approximation algorithm, multiway flow function, NP-complete, directed graphs, polynomial-time algorithm, approximation factor
23Hemant D. Pande, William Landi, Barbara G. Ryder Interprocedural Def-Use Associations for C Systems with Single Level Pointers. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF interprocedural def-use associations, C software systems, single level pointers, value-setting statements, value-fetches, program-point-specific pointer-induced aliases, interprocedural reaching definitions problem, software engineering, computational complexity, data structures, static analysis, NP-hardness, program compilers, polynomial-time algorithm, program diagnostics, C language, indirection
22Robert W. Irving, David Manlove, Sandy Scott Strong Stability in the Hospitals/Residents Problem. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF stable matching problem, hospitals/ residents problem, lower bound, NP-completeness, polynomial-time algorithm, strong stability
22Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. Search on Bibsonomy VLSI Design The full citation details ... 1997 DBLP  DOI  BibTeX  RDF three-layer restricted dogleg routing model, nontrivial lower bound, channel routing problem, two-layer Manhattan routing model, three-layer no-dogleg HVH routing model, two-layer restricted dogleg routing model, vertical constraint graph, VLSI, polynomial time algorithm, VLSI design
22Dimitrios Kagaris, Spyros Tragoudas Maximum independent sets on transitive graphs and their applications in testing and CAD. Search on Bibsonomy ICCAD The full citation details ... 1997 DBLP  DOI  BibTeX  RDF VLSI contexts, physical design automation, scheduling, VLSI, high level synthesis, polynomial time algorithm, CAD tool, channel routing, maximum weighted independent set, path delay fault testing, transitive graphs
22Julian R. Ullmann Analysis of 2-D Occlusion by Subtracting Out. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF 2-D occlusion, subtracting out, complete systematic analysis, synthetically generated noise-free pictures, 2-D objects, computer vision, computer vision, computational complexity, polynomial-time algorithm, template matching, occluded objects
22Ravi Kannan, Thorsten Theobald Games of fixed rank: a hierarchy of bimatrix games. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
22Chung-Sei Rhee, Heok-Jung Kwon, Young-Tak Kwon, Byung-Whan Choi On the real time diagnosability of multiprocessor systems by comparison approach. Search on Bibsonomy RTCSA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF real time diagnosability, comparison approach, multiprocessing systems, multiprocessor systems, polynomial time algorithm, faulty processors
22Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele On the Complexity of Scheduling Conditional Real-Time Code. Search on Bibsonomy WADS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Marie-Christine Costa, Fethi Jarray, Christophe Picouleau An acyclic days-off scheduling problem. Search on Bibsonomy 4OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Workforce scheduling, acyclic scheduling, polynomial time algorithm, maximum flow, discrete tomography
22James H. Anderson, Anand Srinivasan Pfair scheduling: beyond periodic task systems. Search on Bibsonomy RTCSA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Pfair scheduling, periodic task systems, ER-fair scheduling, intra-sporadic tasks, scheduling, real-time systems, real time systems, computational complexity, polynomial-time algorithm
22Jaime Cohen, Claudio L. Lucchesi Minimax relations for T-join packing problems. Search on Bibsonomy ISTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF minimax relations, T-join packing problems, algorithmic results, structural results, minimum T-cut, maximization problem, theorem proving, polynomial time algorithm, perfect matchings, minimax techniques
22Joseph Naor, Baruch Schieber Improved Approximations for Shallow-Light Spanning Trees. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF shallow-light spanning trees, bicriteria optimization, non-trivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design
22P. S. Dasgupta, Susmita Sur-Kolay, Bhargab B. Bhattacharya VLSI floorplan generation and area optimization using AND-OR graph search. Search on Bibsonomy VLSI Design The full citation details ... 1995 DBLP  DOI  BibTeX  RDF VLSI floorplan generation, AND-OR graph search, rectangular dualization, minimum-area floorplan, optimal sizing, heuristic search method, top-down first phase, search effort, bottom-up polynomial-time algorithm, nonslicible floorplans, VLSI, graph theory, circuit layout CAD, circuit optimisation, integrated circuit interconnections, aspect ratios, area optimization, adjacency graph
22Dimitrios Karayiannis, Spyros Tragoudas Uniform area timing-driven circuit implementation. Search on Bibsonomy Great Lakes Symposium on VLSI The full citation details ... 1995 DBLP  DOI  BibTeX  RDF circuit module, cell library, input-output paths, overall area, timing-driven circuit implementation, computational complexity, heuristics, CAD, delays, timing, sequential circuits, sequential circuits, NP-hard, directed graphs, combinational circuits, combinational circuits, logic CAD, polynomial time algorithm, directed acyclic graphs, circuit CAD, cellular arrays, propagation delay
22Michael Sheliga, Edwin Hsing-Mean Sha Bus minimization and scheduling of multi-chip systems. Search on Bibsonomy Great Lakes Symposium on VLSI The full citation details ... 1995 DBLP  DOI  BibTeX  RDF bus minimization, multi-chip module design, scheduling, scheduling, logic CAD, polynomial time algorithm, circuit layout CAD, multichip modules, signal flow graphs, signal flow graphs, algorithm efficiency
21Ferdinando Cicalese, Eduardo Sany Laber On the competitive ratio of evaluating priced functions. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
21Oded Goldreich 0001, Hugo Krawczyk Sparse Pseudorandom Distributions. Search on Bibsonomy CRYPTO The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
20Adam Tauman Kalai, Ankur Moitra, Gregory Valiant Efficiently learning mixtures of two Gaussians. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Gaussians, finite mixture models, method of moments
20Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan Market equilibrium via the excess demand function. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF tâtonnement, algorithms, approximation, polynomial-time algorithms, market equilibrium
20Elena Dubrova A Polynomial Time Algorithm for Non-Disjoint Decomposition of Multiple-Valued Functions. Search on Bibsonomy ISMVL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
20A. N. Trahtman A Polynomial Time Algorithm for Left [Right] Local Testability. Search on Bibsonomy CIAA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF locally testable, algorithm, graph, language, semigroup, deterministic finite automaton
20Shuji Isobe, Xiao Zhou, Takao Nishizeki A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. Search on Bibsonomy WG The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
20Adam R. Klivans, Daniel A. Spielman Randomness efficient identity testing of multivariate polynomials. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
20Michael Krivelevich, Dan Vilenchik Solving random satisfiable 3CNF formulas in expected polynomial time. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
20Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri The Minimum Range Assignment Problem on Linear Radio Networks. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
19Sanjeev Arora Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems
19Slawomir Lasota A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
19Ken-ichi Kawarabayashi, Bruce A. Reed Odd cycle packing. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF odd cycle, packing
19C. P. Ravikumar, Ashutosh Verma, Gaurav Chandra A Polynomial-Time Algorithm for Power Constrained Testing of Core Based Systems. Search on Bibsonomy Asian Test Symposium The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
19Wojciech Plandowski Testing Equivalence of Morphisms on Context-Free Languages. Search on Bibsonomy ESA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
18Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Search on Bibsonomy Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 68Q17, 68Q15, 94A60, Subject classification. 68Q10
18Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis Composing Equipotent Teams. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
18Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. Search on Bibsonomy COLT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
18Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman Improved algorithms for stretch scheduling. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
18Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas Querying priced information in databases: The conjunctive case. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF online algorithms, Competitive analysis
18Hengwu Li Approximation algorithm and scheme for RNA structure prediction. Search on Bibsonomy Int. Conf. Interaction Sciences The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithm, approximation scheme, RNA structure, pseudoknot
18Telikepalli Kavitha, Kurt Mehlhorn A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
18Saugata Basu Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF AMS Subject Classifications 14P10, 14P25, 46E25, 20C20
18Subhash Khot, Assaf Naor Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Ehab S. Elmallah, Hosam M. F. AboElFotoh Circular Layout Cutsets: An Approach for Improving Consecutive Cutset Bounds for Network Reliability. Search on Bibsonomy IEEE Trans. Reliability The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Naoyuki Kamiyama, Naoki Katoh A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Ran Raz, Amir Shpilka Deterministic polynomial identity testing in non-commutative models. Search on Bibsonomy Computational Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF 68Q25, Subject classification
18Ran Raz, Amir Shpilka Deterministic Polynomial Identity Testing in Non-Commutative Models. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
18S. Rao Kosaraju Euler paths in series parallel graphs. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida, Tetsuhiro Miyahara Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables. Search on Bibsonomy ALT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
18Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data. Search on Bibsonomy ALT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
18Helmut Seidl Deciding Equivalence of Finite Tree Automata. Search on Bibsonomy STACS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
17Sumit Gulwani, George C. Necula A Polynomial-Time Algorithm for Global Value Numbering. Search on Bibsonomy SAS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
17Qi Cheng, Shigenori Uchiyama Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. Search on Bibsonomy CT-RSA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
17Noriyuki Fujimoto A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space. Search on Bibsonomy COCOA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
17Raoul Blankertz A polynomial time algorithm for computing all minimal decompositions of a polynomial. Search on Bibsonomy ACM Comm. Computer Algebra The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
17Ferdinando Cicalese, Eduardo Sany Laber A new strategy for querying priced information. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF priced information, competitive analysis, monotone function
17Vikraman Arvind, Piyush P. Kurur A Polynomial Time Nilpotence Test for Galois Groups and Related Results. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
17Haris Aziz 0001, Oded Lachish, Mike Paterson, Rahul Savani Power Indices in Spanning Connectivity Games. Search on Bibsonomy AAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Banzhaf index, Shapley-Shubik index, Network connectivity, coalitional games
17Feng Zou, Xianyue Li, Donghyun Kim 0001, Weili Wu Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
17Mikko Koivisto Parent Assignment Is Hard for the MDL, AIC, and NML Costs. Search on Bibsonomy COLT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
17Mikael Hammar, Bengt J. Nilsson Approximation Results for Kinetic Variants of TSP. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
17Gill Barequet, Matthew Dickerson, Michael T. Goodrich Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
17Stefan Andrei, Albert Mo Kim Cheng, Martin C. Rinard, Lawrence Osborne Optimal Scheduling of Urgent Preemptive Tasks. Search on Bibsonomy RTCSA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF urgent task, polynomial-time algorithm, optimal scheduling
17Panos M. Pardalos Hyperplane Arrangements in Optimization. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Polynomial time algorithm, Hyperplane arrangement
17Kurt M. Anstreicher Linear Programming: Karmarkar Projective Algorithm. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Linear programming, Polynomial time algorithm, Interior point methods, Projective transformation, Potential function
17Kurt M. Anstreicher Linear Programming: Interior Point Methods. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Linear programming, Polynomial time algorithm, Interior point methods
Displaying result #1 - #100 of 1540 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license