Browsing by Subject "Polinomis"
Now showing items 120 of 71

A framework for polynomial time query learnability
(1990)
External research report
Open Access 
A new subdivision algorithm for the flow propagation using polynomial algebras
(20180801)
Article
Open AccessThe Jet Transport method has emerged as a powerful tool for the numerical integration of ordinary differential equations; it uses polynomial expansions to approximate the flow map associated to the differential equation ... 
A polynomial bound for untangling geometric planar graphs
(200912)
Article
Open AccessTo untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos (Discrete Comput. Geom. 28(4): 585–592, 2002) asked if every nvertex geometric planar ... 
A polynomialtime algorithm for the Lambek calculus with brackets of bounded order
(Dagstuhl Publishing, 2017)
Conference report
Open AccessLambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomialtime algorithm for determining provability of bounded depth ... 
A simple proof of the spectral excess theorem for distanceregular graphs
(Elsevier, 20100415)
Article
Restricted access  publisher's policyThe spectral excess theorem provides a quasispectral characterization for a (regular) graph Γ with d+1 distinct eigenvalues to be distanceregular graph, in terms of the excess (number of vertices at distance d) of each ... 
A solution to the tennis ball problem
(2005)
Article
Open AccessWe present a complete solution to the socalled tennis ball problem, which is equivalent to counting the number of lattice paths in the plane that use North and East steps and lie between certain boundaries. The solution ... 
A unified position analysis of the Dixon and the generalized Peaucellier linkages
(20151201)
Article
Open AccessThis paper shows how, using elementary Distance Geometry, a closure polynomial of degree 8 for the Dixon linkage can be derived without any trigonometric substitution, variable elimination, or artifice to collapse mirror ... 
Annuli for the zeros of a polynomial
(201410)
Article
Restricted access  publisher's policy 
Approximate results for rainbow labelings
(201703)
Article
Open AccessA simple graph G=(V,E) is said to be antimagic if there exists a bijection f:E¿[1,E] such that the sum of the values of f on edges incident to a vertex takes different values on distinct vertices. The graph G is distance ... 
Automating Resolution is NPhard
(Institute of Electrical and Electronics Engineers (IEEE), 2019)
Conference report
Open AccessWe show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NPhard. In the parlance of proof complexity, Resolution is not automatizable unless P = NP. Indeed, ... 
Basis expansions and roots of Ehrhart polynomials
(2004)
Article
Open Access 
Boolean decomposition using twoliteral divisors
(Institute of Electrical and Electronics Engineers (IEEE), 2004)
Conference report
Open AccessThis paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of too many Boolean divisors has been the main ... 
Capturing points with a rotating polygon (and a 3D extension)
(201904)
Article
Open AccessWe study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on ... 
Classes of bounded nondeterminism
(1988)
External research report
Open AccessWe study certain language classes located between P and N P that are defined by polynomial time machines with a bounded amount of nondeterminism. We observe that these classes have complete problems and find a characterization ... 
Comparison of Bspline and Zernike fitting techniques in complex wavefront surfaces
(Proc.SPIE Press, 20050613)
Article
Open Access 
Darboux integrals for Schrödinger planar vector fields via Darboux transformations
(20120714)
Article
Open AccessIn this paper we study the Darboux transformations of planar vector fields of Schr odinger type. Using the isogaloisian property of Darboux transformation we prove the \invariance" of the objects of the \Darboux theory ... 
Degree lower bounds of towertype for approximating formulas with parity quantifiers
(20140201)
Article
Open AccessKolaitis and Kopparty have shown that for any firstorder formula with parity quantifiers over the language of graphs, there is a family of multivariate polynomials of constantdegree that agree with the formula on all but ... 
Delegació verificable del càlcul de polinomis
(Universitat Politècnica de Catalunya, 20130215)
Master thesis (preBologna period)
Open Access[ANGLÈS] Algorithms to delegate the evaluation of some polynomial, private or not, at some point, private or not, to an untrusted entity. 
Edgedistanceregular graphs
(20110311)
External research report
Open AccessEdgedistanceregularity is a concept recently introduced by the authors which is similar to that of distanceregularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ... 
Elementary problems and solutions based on binomial coeffcients and CauchySchwarz
(201602)
Article
Restricted access  publisher's policy