Search results for "arithmetic formulas"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Ran Raz	Tensor-rank and lower bounds for arithmetic formulas.	STOC	2010	DBLP DOI BibTeX RDF	homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits
1	Ankit Gupta, Neeraj Kayal, Youming Qiao	Random Arithmetic Formulas can be Reconstructed Efficiently.	Electronic Colloquium on Computational Complexity (ECCC)	2012	DBLP BibTeX RDF
1	Ran Raz	Tensor-Rank and Lower Bounds for Arithmetic Formulas.	Electronic Colloquium on Computational Complexity (ECCC)	2010	DBLP BibTeX RDF
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	Felix Klaedtke	Bounds on the automata size for Presburger arithmetic.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	Automata-based decision procedures, complexity, quantifier elimination, Presburger arithmetic
1	Ruzica Piskac, Viktor Kuncak	Linear Arithmetic with Stars.	CAV	2008	DBLP DOI BibTeX RDF
1	Uffe Flarup, Laurent Lyaudet	On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract).	CSR	2008	DBLP DOI BibTeX RDF
1	Zhimeng Luo, Jianzhong Zhou, Qingqing Li, Li Liu, Li Yang	Partner Selection and Evaluation in Virtual Research Center Based on Trapezoidal Fuzzy AHP.	ISNN	2008	DBLP DOI BibTeX RDF
1	Pascal Koiran, Klaus Meer	On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width.	WG	2008	DBLP DOI BibTeX RDF
1	Ran Raz, Iddo Tzameret	The Strength of Multilinear Proofs.	Computational Complexity	2008	DBLP DOI BibTeX RDF	Subject classification. 03F20, 68Q17, 13P10
1	Uffe Flarup, Pascal Koiran, Laurent Lyaudet	On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Jian Cao, Gengui Zhou	Partner Selection and Evaluation in Agile Virtual Enterprise Based upon TFN-AHP Model.	CSCWD	2006	DBLP DOI BibTeX RDF
1	Constantinos Bartzis, Tevfik Bultan	Efficient BDDs for bounded arithmetic constraints.	STTT	2006	DBLP DOI BibTeX RDF	Model checking, BDD, Integer arithmetic, SMV
1	Andrej Bogdanov, Hoeteck Wee	More on Noncommutative Polynomial Identity Testing.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
1	Ran Raz, Amir Shpilka	Deterministic polynomial identity testing in non-commutative models.	Computational Complexity	2005	DBLP DOI BibTeX RDF	68Q25, Subject classification
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	Ran Raz, Amir Shpilka	Deterministic Polynomial Identity Testing in Non-Commutative Models.	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
1	Felix Klaedtke	On the Automata Size for Presburger Arithmetic.	LICS	2004	DBLP DOI BibTeX RDF
1	Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman	Abstraction-Based Satisfiability Solving of Presburger Arithmetic.	CAV	2004	DBLP DOI BibTeX RDF
1	Constantinos Bartzis, Tevfik Bultan	Construction of Efficient BDDs for Bounded Arithmetic Constraints.	TACAS	2003	DBLP DOI BibTeX RDF
1	Tuba Yavuz-Kahveci, Tevfik Bultan	A symbolic manipulator for automated verification of reactive systems with heterogeneous data types.	STTT	2003	DBLP DOI BibTeX RDF	Composite representation, BDD, Symbolic model checking, Presburger arithmetic
1	Tuba Yavuz-Kahveci, Murat Tuncer, Tevfik Bultan	A Library for Composite Symbolic Representations.	TACAS	2001	DBLP DOI BibTeX RDF
1	Amir Shpilka, Avi Wigderson	Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. (PDF / PS)	IEEE Conference on Computational Complexity	1999	DBLP DOI BibTeX RDF
1	David Chaum, Eugène van Heijst, Birgit Pfitzmann	Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer.	CRYPTO	1991	DBLP DOI BibTeX RDF
1	Norihisa Suzuki, Kiyoshi Ishihata	Implementation of an Array Bound Checker.	POPL	1977	DBLP DOI BibTeX RDF