Search results for "68Q25"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Mao-cheng Cai, Xiaotie Deng, Wenan Zang	A Min-Max Theorem on Feedback Vertex Sets.	IPCO	1999	DBLP DOI BibTeX RDF	bipartite tournament, totally dual integrality, min-max relation, AMS subject classification. 68Q25, approximation algorithm, 68R10, feedback vertex set
2	Jianzhong Zhang 0001, Xiaoguang Yang, Mao-cheng Cai	Reverse Center Location Problem.	ISAAC	1999	DBLP DOI BibTeX RDF	networks and graphs, maximum cost circulation. ams subject classification. 68q25, np-hard, 90c27, relaxation, satisfiability problem
2	A. N. Trahtman	An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.	WIA	1999	DBLP DOI BibTeX RDF	locally threshold testable, semigroup AMS subject classification 68Q25, 68Q68, 20M07, algorithm, deterministic finite automaton, 68Q45
1	Satoru Iwata, Mizuyo Takamatsu	Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 15A22, 34A09, 65L80, 68Q25
1	Dries R. Goossens, Frits C. R. Spieksma	The transportation problem with exclusionary side constraints.	4OR	2009	DBLP DOI BibTeX RDF	MSC classification (2000) 68Q25
1	Jean François Maurras	A family of easy polyhedra.	4OR	2009	DBLP DOI BibTeX RDF	MSC classification (2000) 52B12, 68Q17, 68Q25
1	Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka	The Black-Box Query Complexity of Polynomial Summation.	Computational Complexity	2009	DBLP DOI BibTeX RDF	Subject classification. 68Q05, 68Q17, 68Q25, 68Q15
1	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.	Computing	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 68W40, 68W25
1	Manuel Ceballos, Juan Núñez, Ángel F. Tenorio	Algorithm to compute the maximal abelian dimension of Lie algebras.	Computing	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 17B30, 17B05, 68Q25, 68W40
1	Yurii Nesterov	Primal-dual subgradient methods for convex problems.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C25, 68Q25, 90C47
1	Mateo Restrepo, David P. Williamson	A simple GAP-canceling algorithm for the generalized maximum flow problem.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 05C85, 90C35, 90B10
1	Pawel Przybylowicz	Linear information for approximation of the Itô integrals.	Numerical Algorithms	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68Q25, 65C30
1	Huang Zhengda, Ma Guochun	On the local convergence of a family of Euler-Halley type iterations with a parameter.	Numerical Algorithms	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 65J15, 68Q25
1	Joel Ratsaby	On the complexity of binary samples.	Ann. Math. Artif. Intell.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 06E30, 03C13, 68Q25, 68R05, 68Q32
1	Shahar Sarid, Amir Shapiro	Classifying the multi robot path finding problem into a quadratic competitive complexity class.	Ann. Math. Artif. Intell.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68Q25, 68T40, 11Y16, 93C85, 68Q17, 68Q15, 68W40, 68W15
1	Jin-yi Cai, Pinyan Lu	Basis Collapse in Holographic Algorithms.	Computational Complexity	2008	DBLP DOI BibTeX RDF	68Q25, Subject classification. 68Q17
1	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification via Space-Efficient Direct Products.	Computational Complexity	2008	DBLP DOI BibTeX RDF	94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17
1	Johan Håstad	Every 2-csp Allows Nontrivial Approximation.	Computational Complexity	2008	DBLP DOI BibTeX RDF	Subject classification. 68W25, 68Q25
1	Chris Peikert	Limits on the Hardness of Lattice Problems in lp Norms.	Computational Complexity	2008	DBLP DOI BibTeX RDF	11H06, 94B75, 68Q25, Subject classification. 68Q17
1	Amr Elmasry, Claus Jensen, Jyrki Katajainen	Two new methods for constructing double-ended priority queues from priority queues.	Computing	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68P05, 68P10, 68Q25, 68W40
1	K. Subramani	Computing inversion pair cardinality through partition-based sorting.	Computing	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 68R99, 68W40
1	Zheng Gong, Xuejia Lai, Kefei Chen	A synthetic indifferentiability analysis of some block-cipher-based hash functions.	Des. Codes Cryptography	2008	DBLP DOI BibTeX RDF	AMS Classifications 68W40, 68Q25
1	Igor Semaev	On solving sparse algebraic equations over finite fields.	Des. Codes Cryptography	2008	DBLP DOI BibTeX RDF	68Q25, AMS Classifications 11T71
1	Yurii Nesterov, Arkadi Nemirovski	Primal Central Paths and Riemannian Distances for Convex Sets.	Foundations of Computational Mathematics	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52A41, 53C22, 90C25, 68Q25, 90C22, 90C51, 90C60
1	Fumei Lam, Alantha Newman	Traveling salesman path problems.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 90C27, 68R10, 90C05
1	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.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification 65K05, 68Q25, 90C51, 90C05, 90C60
1	Irène Charon, Olivier Hudry	A survey on the linear ordering problem for weighted or unweighted tournaments.	4OR	2007	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000) 05C20, 05C90, 06A05, 91F10, 90C27, 68Q17, 68Q25, 90C57, 68R10, 90C10, 90C59, 90C35, 05C38, 06A07
1	Bruno Escoffier	Polynomial approximation: a structural and operational study.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 68Q17, 68Q25, 05C15, 68W25
1	Stefan Porschen	On variable-weighted exact satisfiability problems.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 03B05, 68Q25, 05C85
1	Pierre McKenzie, Klaus W. Wagner	The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers.	Computational Complexity	2007	DBLP DOI BibTeX RDF	Subject classification. 68Q25, 68Q15, 03D15
1	Mikkel Thorup	Fully-Dynamic Min-Cut.	Combinatorica	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10
1	Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi Shimoyama	Low-density attack revisited.	Des. Codes Cryptography	2007	DBLP DOI BibTeX RDF	AMS Classification 68P25, 11H31, 94B75, 68Q25
1	Sunayana Ghosh, Sylvain Petitjean, Gert Vegter	Approximation by Conic Splines.	Mathematics in Computer Science	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). Primary 65D07, 65D17 - Secondary 68Q25
1	Alexander Grigoriev, Maxim Sviridenko, Marc Uetz	Machine scheduling with resource dependent processing times.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90B35, 68Q25, 68M20
1	Yurii Nesterov	Dual extrapolation and its applications to solving variational inequalities and related problems.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) S90C25, 68Q25, 90C47
1	Heiko Röglin, Berthold Vöcking	Smoothed analysis of integer programming.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 90C27, 90C10
1	Anthony Man-Cho So, Yinyu Ye	Theory of semidefinite programming for Sensor Network Localization.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 51K05, 52C25, 68Q25, 90C22, 90C35
1	Nader H. Bshouty, Michael Kaminski	Polynomial multiplication over finite fields: from quadratic to straight-line complexity.	Computational Complexity	2006	DBLP DOI BibTeX RDF	Subject classification. 12Y05, 68Q25, 68W40, 68W30
1	Shmuel Safra, Oded Schwartz	On the complexity of approximating tsp with neighborhoods and related problems.	Computational Complexity	2006	DBLP DOI BibTeX RDF	68Q25, Subject classification. 68Q17
1	Michael R. Fellows, Jens Gramm, Rolf Niedermeier	On The Parameterized Intractability Of Motif Search Problems.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03D15, 68Q17, 68Q25
1	Christopher Wolf, An Braeken, Bart Preneel	On the security of stepwise triangular systems.	Des. Codes Cryptography	2006	DBLP DOI BibTeX RDF	11T55, 12F99, 51E26, 14Q99, 14N10, 68Q25, AMS Classification 94A60, 68W40
1	Luc Pronzato, Henry P. Wynn, Anatoly A. Zhigljavsky	Asymptotic behaviour of a family of gradient algorithms in Rd and Hilbert spaces.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C25, 68Q25
1	Venkatesan Guruswami, Daniele Micciancio, Oded Regev	The complexity of the covering radius problem.	Computational Complexity	2005	DBLP DOI BibTeX RDF	11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17
1	Dániel Marx	Parameterized complexity of constraint satisfaction problems.	Computational Complexity	2005	DBLP DOI BibTeX RDF	Subject classification. 68Q25, 68Q17
1	Ran Raz, Amir Shpilka	Deterministic polynomial identity testing in non-commutative models.	Computational Complexity	2005	DBLP DOI BibTeX RDF	68Q25, Subject classification
1	Alan M. Frieze, Nicholas C. Wormald	Random k-Sat: A Tight Threshold For Moderately Growing k.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05D40, 68Q25
1	Leonard J. Schulman, Vijay V. Vazirani	A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q15, 68W20, 62F25, 68Q25, 68W25
1	Andreas Bley	On the complexity of vertex-disjoint length-restricted path problems.	Computational Complexity	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 68Q25, 90C27, 05C38, 05C40
1	Takashi Mihara, Shao Chin Sung	Deterministic polynomial-time quantum algorithms for Simon's problem.	Computational Complexity	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05
1	Vangelis Th. Paschos	Polynomial Approximation and Graph-Coloring.	Computing	2003	DBLP DOI BibTeX RDF	AMS Subject Classification: 05C15, 68Q17, 68Q25, 90C59, 68W25
1	Chi-Jen Lu	Improved Pseudorandom Generators for Combinatorial Rectangles.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05B40, 68Q25, 68R05
1	Mehmet Hakan Karaata, Pranay Chaudhuri	A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net.	Computing	2002	DBLP DOI BibTeX RDF	AMS Subject Classifications: 68M14, 68Q25, 68W15
1	Matthias Krause, Stefan Lucks	Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds.	Computational Complexity	2001	DBLP DOI BibTeX RDF	$ textit{TC}^{0} $, lower bounds.¶ Subject classification. 68Q25, Pseudorandomness, 94A60, function generators
1	Eric J. Anderson, T. S. Jayram, Tracy Kimbrel	Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines.	Computing	2001	DBLP DOI BibTeX RDF	AMS Subject Classifications: 68Q25, 90B35
1	Helge Bahmann, Peter Schatte	Analysis of Some Elementary Algorithms for Prime Factorization.	Computing	2001	DBLP DOI BibTeX RDF	AMS Subject Classifications: 68Q25, 11N05
1	Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky	Testing Monotonicity.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q25, 68R05, 68Q05
1	Vince Grolmusz	Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05D05, 68Q25, 05D10
1	Sanjeev Khanna, Nathan Linial, Shmuel Safra	On the Hardness of Approximating the Chromatic Number.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q17, 68Q25, 68R10
1	Karl-Heinz Niggl	Subrecursive functions on partial sequences.	Arch. Math. Log.	1999	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991): 03D15, 03D45, 03D65, 03D99, 68Q99, 68Q25, 68Q10, 68Q55, 68Q45, 03D20
1	Friedrich Eisenbrand	On the Membership Problem for the Elementary Closure of a Polyhedron.	Combinatorica	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C10, 68Q25, 90C60
1	Alan M. Frieze, Ravi Kannan	Quick Approximation to Matrices and Applications.	Combinatorica	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q25, 68R05
1	Oded Goldreich, Dana Ron	A Sublinear Bipartiteness Tester for Bounded Degree Graphs.	Combinatorica	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q25, 68R10
1	Ran Raz, Pierre McKenzie	Separation of the Monotone NC Hierarchy.	Combinatorica	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q15, 68R99, 68Q25
1	Pranay Chaudhuri	An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components.	Computing	1999	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C85, 68Q22, 68Q25, 68Q10
1	Yossi Azar, Rajeev Motwani, Joseph Naor	Approximating Probability Distributions Using Small Sample Spaces.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 60C05, 68Q22, 94C12, 68Q25, 68R10, 60E15
1	Bernd Gärtner, Martin Henk, Günter M. Ziegler	Randomized Simplex Algorithms on Klee-Minty Cubes.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C05, 52B12, 68Q25
1	Michel X. Goemans, David P. Williamson	Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C27, 68Q25, 05C85
1	Victor Y. Pan	An algebraic approach to approximate evaluation of a polynomial on a set of real points.	Adv. Comput. Math.	1995	DBLP DOI BibTeX RDF	Subject classification 68Q25, 65D05, 65D15, 65Y20
1	Bettina Just	Integer Relations Among Algebraic Numbers.	MFCS	1989	DBLP DOI BibTeX RDF	MSC 68Q25, 12F10, 68Q40