|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 155 occurrences of 56 keywords
|
|
|
Results
Found 69 publication records. Showing 69 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
45 | Jianzhong Zhang 0001, Xiaoguang Yang, Mao-cheng Cai |
Reverse Center Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 279-294, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
networks and graphs, maximum cost circulation. ams subject classification. 68q25, np-hard, 90c27, relaxation, satisfiability problem |
45 | Mao-cheng Cai, Xiaotie Deng, Wenan Zang |
A Min-Max Theorem on Feedback Vertex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 73-86, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
bipartite tournament, totally dual integrality, min-max relation, AMS subject classification. 68Q25, approximation algorithm, 68R10, feedback vertex set |
45 | A. N. Trahtman |
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIA ![In: Automata Implementation, 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999, Revised Papers, pp. 164-173, 1999, Springer, 3-540-42812-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
locally threshold testable, semigroup AMS subject classification 68Q25, 68Q68, 20M07, algorithm, deterministic finite automaton, 68Q45 |
17 | Satoru Iwata 0001, Mizuyo Takamatsu |
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 121(1), pp. 105-121, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 15A22, 34A09, 65L80, 68Q25 |
17 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The Black-Box Query Complexity of Polynomial Summation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(1), pp. 59-79, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q17, 68Q25, 68Q15 |
17 | Jean François Maurras |
A family of easy polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 7(2), pp. 139-144, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
MSC classification (2000) 52B12, 68Q17, 68Q25 |
17 | Dries R. Goossens, Frits C. R. Spieksma |
The transportation problem with exclusionary side constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 7(1), pp. 51-60, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
MSC classification (2000) 68Q25 |
17 | Zhengda Huang, Ma Guochun |
On the local convergence of a family of Euler-Halley type iterations with a parameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 52(3), pp. 419-433, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 65J15, 68Q25 |
17 | Pawel Przybylowicz |
Linear information for approximation of the Itô integrals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 52(4), pp. 677-699, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68Q25, 65C30 |
17 | Mateo Restrepo, David P. Williamson |
A simple GAP-canceling algorithm for the generalized maximum flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 118(1), pp. 47-74, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q25, 05C85, 90C35, 90B10 |
17 | Yurii E. Nesterov |
Primal-dual subgradient methods for convex problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 120(1), pp. 221-259, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C25, 68Q25, 90C47 |
17 | Manuel Ceballos, Juan Núñez 0001, Ángel F. Tenorio |
Algorithm to compute the maximal abelian dimension of Lie algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 84(3-4), pp. 231-239, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 17B30, 17B05, 68Q25, 68W40 |
17 | János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót |
Improved lower bounds for semi-online bin packing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 84(1-2), pp. 139-148, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q25, 68W40, 68W25 |
17 | Yurii E. Nesterov, Arkadi Nemirovski |
Primal Central Paths and Riemannian Distances for Convex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 8(5), pp. 533-560, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 52A41, 53C22, 90C25, 68Q25, 90C22, 90C51, 90C60 |
17 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification via Space-Efficient Direct Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(4), pp. 475-500, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17 |
17 | Chris Peikert |
Limits on the Hardness of Lattice Problems in lp Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 300-351, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
11H06, 94B75, 68Q25, Subject classification. 68Q17 |
17 | Johan Håstad |
Every 2-csp Allows Nontrivial Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(4), pp. 549-566, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 68W25, 68Q25 |
17 | Jin-yi Cai, Pinyan Lu |
Basis Collapse in Holographic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 254-281, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification. 68Q17 |
17 | Joel Ratsaby |
On the complexity of binary samples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 52(1), pp. 55-65, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 06E30, 03C13, 68Q25, 68R05, 68Q32 |
17 | Shahar Sarid, Amir Shapiro |
Classifying the multi robot path finding problem into a quadratic competitive complexity class. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 52(2-4), pp. 169-203, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68Q25, 68T40, 11Y16, 93C85, 68Q17, 68Q15, 68W40, 68W15 |
17 | Zheng Gong, Xuejia Lai, Kefei Chen |
A synthetic indifferentiability analysis of some block-cipher-based hash functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 48(3), pp. 293-305, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
AMS Classifications 68W40, 68Q25 |
17 | Igor A. Semaev |
On solving sparse algebraic equations over finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 49(1-3), pp. 47-60, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q25, AMS Classifications 11T71 |
17 | Fumei Lam, Alantha Newman |
Traveling salesman path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 113(1), pp. 39-59, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q25, 90C27, 68R10, 90C05 |
17 | Renato D. C. Monteiro, Takashi Tsuchiya |
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(1), pp. 105-149, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification 65K05, 68Q25, 90C51, 90C05, 90C60 |
17 | K. Subramani 0001 |
Computing inversion pair cardinality through partition-based sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 83(1), pp. 41-54, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q25, 68R99, 68W40 |
17 | Amr Elmasry, Claus Jensen, Jyrki Katajainen |
Two new methods for constructing double-ended priority queues from priority queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 83(4), pp. 193-204, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68P05, 68P10, 68Q25, 68W40 |
17 | Pierre McKenzie, Klaus W. Wagner |
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(3), pp. 211-244, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q25, 68Q15, 03D15 |
17 | Stefan Porschen |
On variable-weighted exact satisfiability problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 51(1), pp. 27-54, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 03B05, 68Q25, 05C85 |
17 | Mikkel Thorup |
Fully-Dynamic Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(1), pp. 91-127, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10 |
17 | Bruno Escoffier |
Polynomial approximation: a structural and operational study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 5(2), pp. 161-164, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
MSC classification 68Q17, 68Q25, 05C15, 68W25 |
17 | Irène Charon, Olivier Hudry |
A survey on the linear ordering problem for weighted or unweighted tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 5(1), pp. 5-60, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematical Subject Classification (2000) 05C20, 05C90, 06A05, 91F10, 90C27, 68Q17, 68Q25, 90C57, 68R10, 90C10, 90C59, 90C35, 05C38, 06A07 |
17 | Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi Shimoyama |
Low-density attack revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 43(1), pp. 47-59, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
AMS Classification 68P25, 11H31, 94B75, 68Q25 |
17 | Sunayana Ghosh, Sylvain Petitjean, Gert Vegter |
Approximation by Conic Splines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(1), pp. 39-69, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). Primary 65D07, 65D17 - Secondary 68Q25 |
17 | Heiko Röglin, Berthold Vöcking |
Smoothed analysis of integer programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(1), pp. 21-56, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q25, 90C27, 90C10 |
17 | Anthony Man-Cho So, Yinyu Ye 0001 |
Theory of semidefinite programming for Sensor Network Localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 109(2-3), pp. 367-384, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 51K05, 52C25, 68Q25, 90C22, 90C35 |
17 | Yurii E. Nesterov |
Dual extrapolation and its applications to solving variational inequalities and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 109(2-3), pp. 319-344, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991) S90C25, 68Q25, 90C47 |
17 | Alexander Grigoriev, Maxim Sviridenko, Marc Uetz |
Machine scheduling with resource dependent processing times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(1), pp. 209-228, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90B35, 68Q25, 68M20 |
17 | Nader H. Bshouty, Michael Kaminski |
Polynomial multiplication over finite fields: from quadratic to straight-line complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(3), pp. 252-262, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 12Y05, 68Q25, 68W40, 68W30 |
17 | Shmuel Safra, Oded Schwartz |
On the complexity of approximating tsp with neighborhoods and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(4), pp. 281-307, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification. 68Q17 |
17 | Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
On The Parameterized Intractability Of Motif Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(2), pp. 141-167, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03D15, 68Q17, 68Q25 |
17 | Christopher Wolf, An Braeken, Bart Preneel |
On the security of stepwise triangular systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 40(3), pp. 285-302, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
11T55, 12F99, 51E26, 14Q99, 14N10, 68Q25, AMS Classification 94A60, 68W40 |
17 | Luc Pronzato, Henry P. Wynn, Anatoly A. Zhigljavsky |
Asymptotic behaviour of a family of gradient algorithms in Rd and Hilbert spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 107(3), pp. 409-438, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C25, 68Q25 |
17 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 |
The complexity of the covering radius problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(2), pp. 90-121, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17 |
17 | Dániel Marx |
Parameterized complexity of constraint satisfaction problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(2), pp. 153-183, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q25, 68Q17 |
17 | Ran Raz, Amir Shpilka |
Deterministic polynomial identity testing in non-commutative models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(1), pp. 1-19, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification |
17 | Leonard J. Schulman, Vijay V. Vazirani |
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(4), pp. 465-486, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q15, 68W20, 62F25, 68Q25, 68W25 |
17 | Alan M. Frieze, Nicholas C. Wormald |
Random k-Sat: A Tight Threshold For Moderately Growing k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(3), pp. 297-305, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05D40, 68Q25 |
17 | Takashi Mihara, Shao Chin Sung |
Deterministic polynomial-time quantum algorithms for Simon's problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 162-175, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05 |
17 | Andreas Bley |
On the complexity of vertex-disjoint length-restricted path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 131-149, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q25, 90C27, 05C38, 05C40 |
17 | Vangelis Th. Paschos |
Polynomial Approximation and Graph-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 70(1), pp. 41-86, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification: 05C15, 68Q17, 68Q25, 90C59, 68W25 |
17 | Chi-Jen Lu |
Improved Pseudorandom Generators for Combinatorial Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(3), pp. 417-434, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05B40, 68Q25, 68R05 |
17 | Mehmet Hakan Karaata, Pranay Chaudhuri |
A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 68(2), pp. 143-161, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 68M14, 68Q25, 68W15 |
17 | Matthias Krause 0001, Stefan Lucks |
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(4), pp. 297-313, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
$ textit{TC}^{0} $, lower bounds.¶ Subject classification. 68Q25, Pseudorandomness, 94A60, function generators |
17 | Eric J. Anderson, T. S. Jayram, Tracy Kimbrel |
Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 67(1), pp. 83-90, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 68Q25, 90B35 |
17 | Helge Bahmann, Peter Schatte |
Analysis of Some Elementary Algorithms for Prime Factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 66(1), pp. 91-95, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 68Q25, 11N05 |
17 | Sanjeev Khanna, Nathan Linial, Shmuel Safra |
On the Hardness of Approximating the Chromatic Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(3), pp. 393-415, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q17, 68Q25, 68R10 |
17 | Oded Goldreich 0001, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky |
Testing Monotonicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(3), pp. 301-337, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R05, 68Q05 |
17 | Vince Grolmusz |
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(1), pp. 71-86, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05D05, 68Q25, 05D10 |
17 | Ran Raz, Pierre McKenzie |
Separation of the Monotone NC Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(3), pp. 403-435, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q15, 68R99, 68Q25 |
17 | Alan M. Frieze, Ravi Kannan |
Quick Approximation to Matrices and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(2), pp. 175-220, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R05 |
17 | Oded Goldreich 0001, Dana Ron |
A Sublinear Bipartiteness Tester for Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(3), pp. 335-373, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R10 |
17 | Friedrich Eisenbrand |
On the Membership Problem for the Elementary Closure of a Polyhedron. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(2), pp. 297-300, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C10, 68Q25, 90C60 |
17 | Karl-Heinz Niggl |
Subrecursive functions on partial sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 38(3), pp. 163-193, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991): 03D15, 03D45, 03D65, 03D99, 68Q99, 68Q25, 68Q10, 68Q55, 68Q45, 03D20 |
17 | Pranay Chaudhuri |
An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 62(1), pp. 55-67, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 05C85, 68Q22, 68Q25, 68Q10 |
17 | Yossi Azar, Rajeev Motwani 0001, Joseph Naor |
Approximating Probability Distributions Using Small Sample Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(2), pp. 151-171, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 60C05, 68Q22, 94C12, 68Q25, 68R10, 60E15 |
17 | Michel X. Goemans, David P. Williamson |
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(1), pp. 37-59, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C27, 68Q25, 05C85 |
17 | Bernd Gärtner, Martin Henk, Günter M. Ziegler |
Randomized Simplex Algorithms on Klee-Minty Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(3), pp. 349-372, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C05, 52B12, 68Q25 |
17 | Victor Y. Pan |
An algebraic approach to approximate evaluation of a polynomial on a set of real points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 3(1-2), pp. 41-58, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Subject classification 68Q25, 65D05, 65D15, 65Y20 |
17 | Bettina Just |
Integer Relations Among Algebraic Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik, Poland, August 28 - September 1, 1989, Proceedings, pp. 314-320, 1989, Springer, 3-540-51486-4. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
MSC 68Q25, 12F10, 68Q40 |
Displaying result #1 - #69 of 69 (100 per page; Change: )
|
|