Search results for "algebraic complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Pascal Koiran	Decision Versus Evaluation in Algebraic Complexity.	MCU	2007	DBLP DOI BibTeX RDF	Blum-Shub-Smale model, Valiant’s model, computational complexity, algebraic complexity
3	Guillaume Malod, Natacha Portier	Characterizing Valiant's Algebraic Complexity Classes.	MFCS	2006	DBLP DOI BibTeX RDF	Valiant’s theory, skew circuits, polynomials, Determinant, arithmetic circuits, Permanent, Algebraic complexity
2	Paulin Jacobé de Naurois	A Measure of Space for Computing over the Reals.	CiE	2006	DBLP DOI BibTeX RDF	BSS model of computation, weak model, space, algebraic complexity
2	Valentin E. Brimkov, Stefan S. Dantchev	On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model.	IFIP TCS	2000	DBLP DOI BibTeX RDF	Integer programming, Knapsack problem, Algebraic complexity, Complexity bounds
2	Saugata Basu, Richard Pollack, Marie-Françoise Roy	On the Combinatorial and Algebraic Complexity of Quantifier Elimination	FOCS	1994	DBLP DOI BibTeX RDF	complex geometry, first order formulae, asymptotically fastest algorithm, input polynomials, sign partition, polynomials, quantifier elimination, combinatorial complexity, algebraic complexity, real closed fields, first order theory, complexity bound
1	Maurice J. Jansen, Rahul Santhanam	Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes.	STACS	2012	DBLP DOI BibTeX RDF
1	Maurice J. Jansen, Rahul Santhanam	Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Nicolas Courtois	Algebraic Complexity Reduction and Cryptanalysis of GOST.	IACR Cryptology ePrint Archive	2011	DBLP BibTeX RDF
1	Klaus Meer	Tree-width in Algebraic Complexity.	Fundam. Inform.	2010	DBLP DOI BibTeX RDF
1	Pavel Hrubes, Avi Wigderson, Amir Yehudayoff	Non-commutative circuits and the sum-of-squares problem.	STOC	2010	DBLP DOI BibTeX RDF	lower bounds, algebraic complexity
1	Pavel Hrubes, Avi Wigderson, Amir Yehudayoff	Relationless Completeness and Separations.	IEEE Conference on Computational Complexity	2010	DBLP DOI BibTeX RDF	Completeness, Separations, Algebraic complexity
1	Heping Gao, Meera Sitharam	Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces.	SAC	2009	DBLP DOI BibTeX RDF	Henneberg-I graph, combinatorial rigidity, geometric constraints and reasoning, graph characterization, one degree of freedom (1-dof), quadratic or radical solvability, triangle-decomposable or tree-decomposable graph, underconstrained geometric constraint solving, computer aided design, mechanism, linkage, graph minor, algebraic complexity, configuration space
1	Ran Raz	Multi-linear formulas for permanent and determinant are of super-polynomial size.	J. ACM	2009	DBLP DOI BibTeX RDF	arithmetic formulas, lower bounds, circuit complexity, algebraic complexity
1	Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas	Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses.	Symposium on Solid and Physical Modeling	2009	DBLP DOI BibTeX RDF
1	Peter Bürgisser	On Defining Integers And Proving Arithmetic Circuit Lower Bounds.	Computational Complexity	2009	DBLP DOI BibTeX RDF	Primary 68Q17, Secondary 11D45, Subject classification
1	Guillaume Malod, Natacha Portier	Characterizing Valiant's algebraic complexity classes.	J. Complexity	2008	DBLP DOI BibTeX RDF
1	Erich Kaltofen, Pascal Koiran	Expressing a fraction of two determinants as a determinant.	ISSAC	2008	DBLP DOI BibTeX RDF	algebraic complexity theory, formula complexity, strassen's removal of divisions, toda's skew circuits, valiant's universality of determinants
1	Lingguo Cui, Liyan Xu, Yong Wang	A New SPN Structure for Block Ciphers.	ICNSC	2008	DBLP DOI BibTeX RDF
1	Ildikó Pelczer, Fernando Gamboa Rodríguez	Design of a System for Automated Generation of Problem Fields.	Intelligent Tutoring Systems	2008	DBLP DOI BibTeX RDF	automated problem generation, problem fields, mathematics
1	Daniel J. Bernstein	The Tangent FFT.	AAECC	2007	DBLP DOI BibTeX RDF	Tangent FFT, split-radix FFT, modified split-radix FFT, scaled odd tail, DFT, communication complexity, convolution, polynomial multiplication, algebraic complexity
1	Pascal Koiran, Sylvain Perifel	VPSPACE and a Transfer Theorem over the Reals.	STACS	2007	DBLP DOI BibTeX RDF	Blum-Shub-Smale model, Valiant’s model, computational complexity, algebraic complexity
1	Peter Bürgisser	On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.	STACS	2007	DBLP DOI BibTeX RDF
1	Peter Bürgisser	On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity.	Electronic Colloquium on Computational Complexity (ECCC)	2006	DBLP BibTeX RDF
1	Anthony Widjaja To	Review of "Algebraic Complexity Theory by Peter Bürgisser, Michael Clausen and Amin Shokrollahi", Springer 1997.	SIGACT News	2006	DBLP DOI BibTeX RDF
1	Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir	On the Union of kappa-Round Objects in Three and Four Dimensions.	Discrete & Computational Geometry	2006	DBLP DOI BibTeX RDF
1	Zeev Dvir, Amir Shpilka	Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.	STOC	2005	DBLP DOI BibTeX RDF	depth 3 circuits, locally decodable codes, polynomial identity testing
1	Jarek Rossignac	Shape complexity.	The Visual Computer	2005	DBLP DOI BibTeX RDF	Compression, Geometry, Morphology, Simplification
1	Irit Katriel	On the algebraic complexity of set equality and inclusion.	Inf. Process. Lett.	2004	DBLP DOI BibTeX RDF
1	Ran Raz	Multi-linear formulas for permanent and determinant are of super-polynomial size.	STOC	2004	DBLP DOI BibTeX RDF	arithmetic formulas, computational complexity, lower bounds, circuit complexity, algebraic complexity
1	Peter Bürgisser, Martin Lotz	Lower bounds on the bounded coefficient complexity of bilinear maps.	J. ACM	2004	DBLP DOI BibTeX RDF	bilinear circuits, lower bounds, Algebraic complexity, singular values
1	J. M. Landsberg, Laurent Manivel	On the Ideals of Secant Varieties of Segre Varieties.	Foundations of Computational Mathematics	2004	DBLP DOI BibTeX RDF	Secant variety, Segre variety, Border rank, Algebraic complexity
1	Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir	On the union of kapa-round objects.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	union of objects, combinatorial complexity, fat objects
1	Abbas Edalat, Dirk Pattinson	A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems.	PARA	2004	DBLP DOI BibTeX RDF
1	Peter Bürgisser	The Complexity of Factors of Multivariate Polynomials.	Foundations of Computational Mathematics	2004	DBLP DOI BibTeX RDF
1	Gene Itkis	Cryptographic tamper evidence.	ACM Conference on Computer and Communications Security	2003	DBLP DOI BibTeX RDF	evolving cryptosystems, key evolution, tamper evidence, digital signatures, exposures
1	Mark Foskey, Ming C. Lin, Dinesh Manocha	Efficient computation of a simplified medial axis.	Symposium on Solid Modeling and Applications	2003	DBLP DOI BibTeX RDF	medial axis, distance field
1	Leif Kobbelt, Mario Botsch	Freeform Shape Representations for Efficient Geometry Processing.	Shape Modeling International	2003	DBLP DOI BibTeX RDF
1	Christophe Andrieu	Monte Carlo Methods for Absolute Beginners.	Advanced Lectures on Machine Learning	2003	DBLP BibTeX RDF
1	Markus Bläser	Algebras of Minimal Rank over Arbitrary Fields.	STACS	2003	DBLP DOI BibTeX RDF
1	Ricard Gavaldà, Denis Thérien	Algebraic Characterizations of Small Classes of Boolean Functions.	STACS	2003	DBLP DOI BibTeX RDF
1	Qi Cheng	Straight-line programs and torsion points on elliptic curves.	Computational Complexity	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 14H52, 68Q17
1	Markus Bläser	Algebras of Minimal Rank over Perfect Fields. (PDF / PS)	IEEE Conference on Computational Complexity	2002	DBLP DOI BibTeX RDF	algebras of minimal rank, multiplication, bilinear complexity
1	Peter Bürgisser	On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.	MFCS	2001	DBLP DOI BibTeX RDF
1	Joos Heintz, Guillermo Matera, Ariel Waissbein	On the Time-Space Complexity of Geometric Elimination Procedures.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Algorithmic elimination theory, Polynomial equation solving, Algebraic complexity theory, Time-space complexity, Computation tree, Symbolic computation, Straight-line program
1	Leslie G. Valiant	Quantum computers that can be simulated classically in polynomial time.	STOC	2001	DBLP DOI BibTeX RDF
1	Ricard Gavaldà, Denis Thérien	Learning Expressions over Monoids.	STACS	2001	DBLP DOI BibTeX RDF
1	Valentin E. Brimkov, Stefan S. Dantchev	On the Algebraic Complexity of Integer Programming	Electronic Colloquium on Computational Complexity (ECCC)	2000	DBLP BibTeX RDF
1	Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo	Time-Space Tradeoffs in Algebraic Complexity Theory.	J. Complexity	2000	DBLP DOI BibTeX RDF
1	Pascal Koiran	Circuits versus Trees in Algebraic Complexity.	STACS	2000	DBLP DOI BibTeX RDF
1	Florence Cloppet, Jean-Michel Oliva, Georges Stamon	Angular Bisector Network, a Simplified Generalized Voronoi Diagram: Application to Processing Complex Intersections in Biomedical Images.	IEEE Trans. Pattern Anal. Mach. Intell.	2000	DBLP DOI BibTeX RDF	generalized Voronoi diagram, graph theory, skeleton, Shape descriptors
1	Y. Yam	Reducing the Number of Rules in Intelligent Control: A New Application Area for Algebraic Complexity Techniques.	Bulletin of the EATCS	1999	DBLP BibTeX RDF
1	Timm Ahrendt	Fast Computations of the Exponential Function.	STACS	1999	DBLP DOI BibTeX RDF
1	Thomas Lickteig, Klaus Meer	Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks.	J. Complexity	1997	DBLP DOI BibTeX RDF
1	Thomas Lickteig, Marie-Françoise Roy	Semi-algebraic Complexity of Quotients and Sign Determination of Remainders.	J. Complexity	1996	DBLP DOI BibTeX RDF
1	Saugata Basu, Richard Pollack, Marie-Françoise Roy	On the Combinatorial and Algebraic Complexity of Quantifier Elimination.	J. ACM	1996	DBLP DOI BibTeX RDF	Tarski-Seidenberg principle, quantifier elimination, real closed fields
1	Andrew Chi-Chih Yao	Groups and Algebraic Complexity (Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Ioannis Z. Emiris, John F. Canny	An Efficient Approach to Removing Geometric Degeneracies.	Symposium on Computational Geometry	1992	DBLP DOI BibTeX RDF
1	W. Baur	On the Algebraic Complexity of Rational Iteration Procedures.	Theor. Comput. Sci.	1991	DBLP DOI BibTeX RDF
1	Jacques Morgenstern	Invariant and Geometric Aspects of Algebraic Complexity Theory I.	J. Symb. Comput.	1991	DBLP DOI BibTeX RDF
1	Erich Kaltofen, Bruno Buchberger	Special Issue Computational Algebraic Complexity Editorial.	J. Symb. Comput.	1990	DBLP DOI BibTeX RDF
1	Volker Strassen	Algebraic Complexity Theory.	Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)	1990	DBLP BibTeX RDF
1	Faith E. Fich, Martin Tompa	The parallel complexity of exponentiating polynomials over finite fields.	J. ACM	1988	DBLP DOI BibTeX RDF
1	John F. Canny, Bruce Randall Donald	Simplified Voronoi Diagrams.	Symposium on Computational Geometry	1987	DBLP DOI BibTeX RDF
1	Bernd Mahr	Algebraic Complexity of Path Problems.	ITA	1982	DBLP BibTeX RDF
1	Carl Sturtivant	Generalised Symmetries of Polynomials in Algebraic Complexity	FOCS	1982	DBLP DOI BibTeX RDF
1	Nicholas Pippenger	Algebraic Complexity Theory.	IBM Journal of Research and Development	1981	DBLP BibTeX RDF