Results 1  10
of
762,465
Complexity of the BollobásRiordan Polynomial  Exceptional Points and Uniform Reductions
"... The coloured Tutte polynomial by Bollobás and Riordan is, as a generalization of the Tutte polynomial, the most general graph polynomial for coloured graphs that satisfies certain contractiondeletion identities. Jaeger, Vertigan, and Welsh showed that the classical Tutte polynomial is #Phard to ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
reductions, that are wellsuited to investigate the evaluation complexity of graph polynomials. Our main result identifies a small, algebraic set of exceptional points and says that the evaluation problem of the coloured Tutte is equivalent for all nonexceptional points, under polynomialtime uniform
Polynomials
, 2006
"... Time series are unstructured data; they are difficult to monitor, summarize and predict. Weather forecasts, stock market prices, medical data (ECG, EEG) are examples of nonstationary time series we wish to clean, classify and index. Segmentation organizes time series into few intervals having unifo ..."
Abstract
 Add to MetaCart
an adaptive time series model where the polynomial degree of each interval vary (flat, linear and so on). Given a number of regressors, the cost of each interval is its polynomial degree: flat intervals cost 1 regressor, linear intervals cost 2 regressors, and so on. Our goal is to minimize the Euclidean (l2
Polynomial time uniform word problems
 Mathematical Logic Quarterly
, 1995
"... We have two polynomial time results for the uniform word problem for a quasivariety Q: • The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. • Let Q? be the relational class determined by Q. If any univ ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
We have two polynomial time results for the uniform word problem for a quasivariety Q: • The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. • Let Q? be the relational class determined by Q. If any
Computational complexity of graph polynomials
, 2010
"... provides hardness and algorithmic results for graph polynomials. We observe VNPcompleteness of the interlace polynomial, and we prove VNPcompleteness of almost all qrestrictions of Z(G; q,x), the multivariate Tutte polynomial. Using graph transformations, we obtain pointtopoint reductions for ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
provides hardness and algorithmic results for graph polynomials. We observe VNPcompleteness of the interlace polynomial, and we prove VNPcompleteness of almost all qrestrictions of Z(G; q,x), the multivariate Tutte polynomial. Using graph transformations, we obtain pointtopoint reductions
Uniform proof complexity
, 2005
"... We define the notion of the uniform reduct of a propositional proof system as the set of those bounded formulas in the language of Peano Arithmetic which have polynomial size proofs under the ParisWilkietranslation. With respect to the arithmetic complexity of uniformhard and obviously reducts, we ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define the notion of the uniform reduct of a propositional proof system as the set of those bounded formulas in the language of Peano Arithmetic which have polynomial size proofs under the ParisWilkietranslation. With respect to the arithmetic complexity of uniformhard and obviously reducts
Results 1  10
of
762,465